Binary Tree Height

Question

I need a general formula to calculate the minimum height of the binary tree and the maximum height of the binary tree. (not the binary search tree)

Answer 1

The max height is n and the min height (IE a perfect binary tree) is the (log base 2( n + 1)) - 1