Aspire's Library
A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations - NIMCET
Study Stuff for MCA Examinations - NIMCET
Previous Year Question (PYQs)
Worst case time complexity of inserting into an empty linear linked list, if list must remain sorted?
Solution
Solution: To keep list sorted, insertion needs traversal O(n).
Answer: (A) Θ(n)
Answer: (A) Θ(n)
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Ask Your Question or Put Your Review.
