notes in formal waywe can define binary tree as finite set of nodes which is either empty or partitioned in to sets of tltrwhere is the root and tl and tr are left and right binary treesrespectively figure binary tree structure sofor binary tree we find that the maximum number of nodes at level will be - if is the depth of the tree then the maximum number of nodes that the tree can have is - - types of binary tree there are two main binary tree and these are full binary tree complete binary tree full binary tree full binary tree is binary of depth having nodes if it has it is not full binary tree examplefor the number of nodes full binary tree with depth is shown in figure full binary tree we use numbers from to as labels of the nodes of the tree if binary tree is fullthen we can number its nodes sequentially fom to - starting from the root nodeand at every level numbering the nodes from left to right lovely professional university