Binary Search Tree

left < parent < right
Inorder traverse : array is ascendent sorted

Balanced Binary Tree

The absolute value of the height difference between the two subtrees is no more than 1

Complete Binary Tree

Except last layer, all the other layer are full with nodes
For last layer, all nodes are as far left as possible.