Which of the following statements is false?

GATE · 1998 · CS · Question 1 subparts

1. A.

   A tree with n nodes has n - 1 edges.

2. B.

   A labeled rooted binary tree can be uniquely constructed from its preorder and postorder traversal results.

3. C.

   A complete binary tree with n internal nodes has n + 1 leaves.

4. D.

   The maximum number of nodes in a binary tree of height h is 2^(h + 1) - 1.

Attempted by 461 students.

The worked solution is available to enrolled students.