What is the minimum possible height (in edges) of a binary tree that contains 25 nodes?

Explanation

A binary tree of height h holds at most 2^(h+1) − 1 nodes; height 3 gives only 15 nodes while height 4 allows up to 31, so 4 is the minimum.