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

PYQ GATE 2005

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 694 students.

Sign up free to check your answer

Sign up free

Explore the full course: Data Structures

Loading lesson…