Properties of Binary Trees
Property 1 has at most one node (i >= 1) on the ith level of a binary tree .
Property 2 A binary tree of depth k has at most 
one node (k >= 1).
Property 3 For any binary tree T, if the number of terminal nodes is n and the number of nodes with degree 2 is m, then n = m + 1.
Property 4 The depth of a complete binary tree with n nodes is 
.
