↧
Answer by Yuval Filmus for What to infer about maximum height of AVL tree...
Perhaps the simplest way out is to solve the recurrence explicitly. Let $m(h) = n(h) + 1$. Then $m(h)$ satisfies the recurrence$$m(h) = n(h) + 1 = n(h-1) + n(h-2) + 2 = m(h-1) + m(h-2).$$The initial...
View ArticleWhat to infer about maximum height of AVL tree from these three different...
I have came across following problem:What is the maximum height of any AVL-tree with 7 nodes?The recurrence giving number of nodes $n$ in the AVL tree for given height $h$ is as...
View Article