**Apologies for the wrong tag, I couldn’t find the relevant tag.**

For module 8 approach pack, the constraints mention that

- The tree is balanced
- The maximum number of nodes in the tree can be
`50000`

Based on these constraints, I assumed that a good approximation for the upper bound of the tree height would be about `log2(100000) = 17`

, so I tried to check for each depth from 1 to 20 for good measure. However, it failed all performance tests. When I changed the upper limit to 30, surprisingly the assessment passed. Please help me understand when would the height of a balanced binary tree be more than `log2(N)`

?