GATE CS 2025 (Afternoon) — Question 13

Data StructuresLinked Lists & Binary TreesMCQ1 mark · −1/3 if wrongEasy

Consider a binary tree \( T \) in which every node has either zero or two children. Let \( n > 0 \) be the number of nodes in \( T \). Which ONE of the following is the number of nodes in \( T \) that have exactly two children?
  1. A
    \( \frac{n - 2}{2} \)
  2. B
    \( \frac{n - 1}{2} \)
  3. C
    \( \frac{n}{2} \)
  4. D
    \( \frac{n + 1}{2} \)
Practise the full 2025-AN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkIntroduction to Algorithms (CLRS)The standard reference behind most GATE algorithm questions.
Practise more on Linked Lists & Binary TreesTimed, 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