In a binary tree, for every node the difference between the number of nodes in…

GATE · 2005 · IT

In a binary tree, for every node the difference between the number of nodes in the left and right subtrees is at most 2. If the height of the tree is h > 0, then the minimum number of nodes in the tree is:

  1. A.

    2h - 1

  2. B.

    2h - 1 + 1

  3. C.

    2h - 1

  4. D.

    2h

Attempted by 515 students.

Show answer

Correct answer: B

The worked solution is available to enrolled students.

Video solution available to enrolled students.

Explore the full course: Iocl Engineers Officers Grade A Paper 2

Loading lesson…