Q1.24

A tree with a $n$ nodes has $(n – 1)$ edges

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

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

The maximum number of nodes in a binary tree of height h is $2^{h+1} - 1$