Q25

The height of any rooted tree is defined as the maximum number of edges in the path from the root node to any leaf node. Suppose a Min-Heap $\text{T}$ stores $32$ keys. The height of $\text{T}$ is ___________. (Answer in integer)