GATE CS 2026 (Forenoon) — Question 23

Data StructuresBSTs & Binary HeapsMSQ1 markMedium

Let \( n \) be an odd number greater than 100. Consider a binary minheap with \( n \) elements stored in an array \( P \) whose index starts from 1. Which of the following indices of \( P \) do/does NOT correspond to any leaf node of the minheap?
  1. A
    \( \frac{n+1}{2} \)
  2. B
    \( \frac{n-1}{2} \)
  3. C
    \( \frac{n-3}{2} \)
  4. D
    \( n \)
Practise the full 2026-FN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAPractise this subject in the exam simulatorTimed, GATE-style tests with analytics that find your weak topics.
Practise more on 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