GATE DA 2024 — Question 52

Programming, Data Structures and Algorithmsbasic data structures: stacks, queues, linked lists, trees, hash tablesMSQ2 marksMedium

Let \(H\), \(I\), \(L\), and \(N\) represent height, number of internal nodes, number of leaf nodes, and the total number of nodes respectively in a rooted binary tree. Which of the following statements is/are always TRUE?
  1. A
    \(L \le I + 1\)
  2. B
    \(H + 1 \le N \le 2^{H+1} - 1\)
  3. C
    \(H \le I \le 2^H - 1\)
  4. D
    \(H \le L \le 2^{H-1}\)
Practise the full 2024 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 basic data structures: stacks, queues, linked lists, trees, hash tablesTimed, 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