GATE CS 2020 (Forenoon) — Question 26

Data StructuresLinked Lists & Binary TreesMCQ1 mark · −1/3 if wrongMedium

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?
  1. A
    \( \Theta(n) \)
  2. B
    \( \Theta(n \log n) \)
  3. C
    \( \Theta(n^2) \)
  4. D
    \( \Theta(1) \)
Practise the full 2020-FN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkIntroduction to Algorithms (CLRS)The standard reference behind most GATE algorithm questions.
Practise more on Linked Lists & Binary TreesTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group