If the out degree of each and every node is exactly equal to 2 or 0 and their number of nodes at level i is 2(i-1) then the tree is called a full or complete binary tree.
