Medium Understand Linked Lists Multiple Choice
Space complexity of top-down recursive merge sort on a linked list?
Understand — Tests comprehension and ability to explain concepts.
Answer Options
A O(1)
B O(log n)
C O(n)
D O(n log n)
Want to see the correct answer?
Get the answer with a detailed explanation, plus practice 33+ more Linked Lists questions with adaptive quizzes and timed interviews.
See the Answer on Guru Sishya →This question is from the Linked Lists topic (Data Structures).
More Linked Lists Questions
Time complexity of accessing the kth element of a singly linked list?
EasyTime complexity of reversing a singly linked list?
EasyOutput of reversing [1,2,3,4,5]?
EasyTime complexity of inserting a node immediately AFTER a given node (pointer already in hand)?
EasySpace complexity of Floyd's cycle detection?
Easy