Tagged Questions
0
votes
2answers
138 views
Explanation of why the height of a binary tree $\theta({lg}(n))$.
From Heap Sort chapter of Introduction to algorithms :
Since a heap of n elements is based on a complete binary tree , its
height is $\theta({lg}(n))$.
I know this is correct but how can this ...
