Full and Complete Binary Trees 

Full binary tree: 
Each node is either a leaf or internal node with exactly two non -empty children. 

Complete binary tree: 
If the height of the tree is h, 
then all levels except possibly level h-1  
are completely full. Level h-1 has all nodes filled in to the left side.