GATE CS 2021 (Forenoon) — Question 20

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

A binary search tree \(T\) contains \(n\) distinct elements. What is the time complexity of picking an element in \(T\) that is smaller than the maximum element in \(T\)?
  1. A
    \(\theta(n \log n)\)
  2. B
    \(\theta(n)\)
  3. C
    \(\theta(\log n)\)
  4. D
    \(\theta(1)\)
Practise the full 2021-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