What is the height of a binary tree with n nodes in the worst case?

For the height h' of a binary tree, for which no further attributes are given than the number n' of nodes, holds:

ceil( ld n) <= h <= n

Where ld' is the binary logarithm and ceil' is rounding up to the next integer.