Answer: That is correct. In a binary tree, each node has at most two child nodes (hence the name "binary"), and the height of the tree is the length of the longest path from the root node to a leaf node.
If the tree has n leaves, then the number of nodes in the tree is at most 2n-1 (since each node can have at most 2 child nodes and there is only one root node), and the height of the tree is log2(2n) = log2n + 1 (since there are 2n nodes at level log2n, and we need to add 1 for the root node).
However, if the tree is not perfectly balanced, it is possible for the height to be slightly larger than log2n + 1. Nonetheless, log2n is still a tight upper bound on the height of a binary tree with n leaves.