Different Types of Tree

FULL BINARY TREE :

                                A Full Binary Tree is a Binary Tree in which Every Node other than Leaf Nodes should  have two children(Left and right) .

                                    

COMPLETE BINARY TREE:

                               A Complete Binary Tree is a Binary Tree in which every level,Except last level is completely filled.If Nodes in Lat level are not completely filled then they should be in filled in order from left to right.

    i.e. Except last level all levels should be completely filled and last level should be filled in order from left to right.If there conditions are not satisfied then that binary tree is not complete binary tree.

SKEWED TREE :

                           A skewed tree is a tree consisting of only left subtree or only right subtree.