InterviewSolution
Saved Bookmarks
| 1. |
What is the worst case time complexity of inserting n elements into an empty linked list, if the linked list needs to be maintained in sorted order ?(A) Θ(n)(B) Θ(n log n)(C) Θ(n2)(D) Θ(1) |
| Answer» | |