Aspire Faculty ID #12704 · Topic: JECA MCA 2024 · Just now
JECA MCA 2024

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)

Previous 10 Questions — JECA MCA 2024

Nearest first

Next 10 Questions — JECA MCA 2024

Ascending by ID
Ask Your Question or Put Your Review.

loading...