datastructure

Perfect Binary Tree Complete Binary Tree A Perfect Binary Tree is also a Complete Binary Tree. Skewed Binary Tree Property of Binary Tree the number of numbers of nodes in a K level of a Binary Tree is 2k.   in some literature, the level of the Binary Tree is mesmerized from 1 (Root). The maximum number of inner nodes in a Binary Tree of Height (H) is 2h + 1 - 1 Maximum nodes of a Binary Tree from Height 3 = 1 + 2 + 4 + 8 = 20 + 21 + 22 + 23 = 24 - 1 = 15 The minimum height (Height) of a Binary Tree of n nodes is 2log (n). The maximum height (Height) of a Binary Tree of n nodes is n - 1.