•In fact, the height of binary trees can be mathematically predicted
•Given that we need to store N nodes in a binary tree, the maximum height is N
•The minimum height is:
–log2N + 1
•Given a height of a tree, H, the minimum and maximum number of nodes would be:
–min: H max:
2H-1
