GATE CS 2024 (Forenoon) — Question 43

Data StructuresBinary Search Trees (BSTs) & Binary HeapsMCQ2 marks · −2/3 if wrongMedium

Consider a binary min-heap containing 105 distinct elements. Let \( k \) be the index (in the underlying array) of the maximum element stored in the heap. The number of possible values of \( k \) is
  1. A
    53
  2. B
    52
  3. C
    27
  4. D
    1
Practise the full 2024-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 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