- Tree with $n$ nodes must have $n-1$ edges.
- A labeled rooted binary tree can be uniquely constructed given its postorder and preorder traversal results. (inorder must be needed with either preorder or postorder for that)
- A complete binary tree with $n$ nodes can have $n$ leaves also
- Example:
Since: A complete binary tree is a binary tree in which every level, except possibly the last, is completely filled, and all nodes are as far left as possible. So false
- The maximum number of nodes in a binary tree of height $h$ is
$1+2+4+.....+2^h=2^{h+1}-1$ So true
Answer is b and c both.
Since, $2$ answers are there I would choose b, because in some places by "complete" binary tree they mean "full binary tree" which has all the levels completely filled.