GATE CS 2020 (Forenoon) — Question 16

Data StructuresBinary Search Trees (BSTs) & Binary HeapsMCQ1 mark · −1/3 if wrongMedium

What is the worst case time complexity of inserting \( n^2 \) elements into an AVL-tree with \( n \) elements initially?
  1. A
    \( \Theta(n^4) \)
  2. B
    \( \Theta(n^2) \)
  3. C
    \( \Theta(n^2 \log n) \)
  4. D
    \( \Theta(n^3) \)
Practise the full 2020-FN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAFree All-India Mock — every SundayA full GATE CS paper, exactly 180 minutes, ranked across India with your GATE score.
Practise more on Binary Search Trees (BSTs) & Binary HeapsTimed, 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