how to prove that a binary tree with a depth of k (k > = 1) has at most 
how to prove that a binary tree with a depth of k (k > = 1) has at most
Mathematical induction,
or buy this algorithm textbook to learn from scratch
binary tree characteristics and proof
hope it can help you.