open navigation menu
AiFolder
Tools for a smarter you
Discover
Tools
AI
Games
Interviews
Blog
More
Search AiFolder
Toggle theme
Toggle theme
Sign in
Exit
00:00
Submit test
Linked Lists · Advanced
10 questions · Question 1 of 10
10%
Multiple Choice
Senior
Why is Merge sort preferred over Quick sort for sorting Linked Lists?
A
This can be achieved by traversing the tree in the in order manner that is, left the child root right node.
B
To detect if a list is cyclic, we can check whether a node had been visited before.
C
Quicksort depends on being able to index (or random access) into an array or similar structure.
D
A linked list can typically only be accessed via its head node.
Previous
Next