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)
The minimum height is h=ceiling( log(n+1)/log(2) -1) for any binary tree.