The GATE Grind

GATE 2007 CS – Question 12

Programming and Data Structures · Trees and Binary Search Trees · 1 mark · Multiple choice

Tree height is the maximum number of root-to-leaf edges. What maximum nodes can a height-h binary tree have?

  1. $2^h-1$
  2. $2^{h-1}-1$
  3. $2^{h+1}-1$
  4. $2^{h+1}$

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (C) $2^{h+1}-1$

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More Trees and Binary Search Trees questions

All Trees and Binary Search Trees questions →