All Questions
Tagged with bounded-depth binary-trees
1 question
5
votes
0
answers
172
views
Height of AVL tree with random elements
I know that for an AVL tree of N nodes, the depth of the tree is bounded by
$$ \log_2(N + 1) -1 \leq height \leq c \log_2(N + 2) + b$$
where $c,b$ are taken from the golden ratio linked to the worst ...
- 171