A tree is a hierarchical structure with a root and child subtrees. Binary trees have at most two children per node.
1Properties
Max nodes at level l (root level 0) = 2^l
Max nodes in a tree of height h = 2^h − 1
A full binary tree with i internal nodes has i + 1 leaves
Minimum height for n nodes = ⌈log₂(n + 1)⌉