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

With n-nodes the possible maximum height is floor(log(n)) = ceil (log(n+1))-1.

With n-nodes the possible minimum height is n-1.