GATE CS 2021 (Afternoon) — Question 12

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

Let \(H\) be a binary min-heap consisting of \(n\) elements implemented as an array. What is the worst case time complexity of an optimal algorithm to find the maximum element in \(H\)?
  1. A
    \(\Theta(1)\)
  2. B
    \(\Theta(\log n)\)
  3. C
    \(\Theta(n)\)
  4. D
    \(\Theta(n \log n)\)
Practise the full 2021-AN 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