Concatenation of 2 linked list will take a time complexity of? Your answer: O O(n) O...

Transcribed Image Text:

Concatenation of 2 linked list will take a time complexity of? Your answer: O O(n) O O(n) None of them O 0(1) O O(nlogn) O O(logn) O(1) if we have address of last node of one of the lists. Concatenation of 2 linked list will take a time complexity of? Your answer: O O(n) O O(n) None of them O 0(1) O O(nlogn) O O(logn) O(1) if we have address of last node of one of the lists.

Answer rating: 100% (QA)

The image shows a multiplechoice question about the time complexity of concatenating two linked lists The options given are On On2 None of them O1 On log n Olog n O1 if we have the address of the last node of one of the lists The correct answer is O1 if we have the address of the last node of one of the lists In a linked list ... View the full answer