Question Id : 12704 |
Context : JECA MCA 2024
Worst case time complexity of inserting into an empty linear linked list, if list must remain sorted?
🎥 Video solution / Text Solution of this question is given below:
Solution: To keep list sorted, insertion needs traversal O(n).
Answer: (A) Θ(n)
1