edited by
16,700 views
37 votes
37 votes

Which of the following statements is false?

  1.  A tree with a $n$ nodes has $(n – 1)$ edges
  2.  A labeled rooted binary tree can be uniquely constructed given its postorder and preorder traversal results.
  3.  A complete binary tree with $n$ internal nodes has $(n + 1)$ leaves.
  4.  The maximum number of nodes in a binary tree of height h is $2^{h+1} - 1$
edited by

5 Answers

–1 votes
–1 votes

Option C will be true in case of strictly binary tree in which each non leaf node has non empty left and right child. 

Answer:

Related questions

29 votes
29 votes
11 answers
1
Kathleen asked Sep 25, 2014
14,547 views
A complete $n$-ary tree is one in which every node has $0$ or $n$ sons. If $x$ is the number of internal nodes of a complete $n$-ary tree, the number of leaves in it is g...
21 votes
21 votes
1 answer
2
Kathleen asked Sep 26, 2014
4,132 views
Derive a recurrence relation for the size of the smallest AVL tree with height $h$.What is the size of the smallest AVL tree with height $8$?
26 votes
26 votes
5 answers
3
28 votes
28 votes
5 answers
4
Kathleen asked Sep 12, 2014
8,851 views
A $2-3$ tree is such thatAll internal nodes have either $2$ or $3$ childrenAll paths from root to the leaves have the same lengthThe number of internal nodes of a $2-3$ t...