Complete Binary Tree
Is a tree with height h where:
- Every node is full upto level h-2,
- Level h-1 is completely filled.
- Level h is filled from left to right.
Yields to array representation. How to compute indices of parent and child?
How many internal nodes and leafs?