Add to Chrome
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
Balanced search trees
What exactly does the AVL balance condition require?
At the root, the heights of the two subtrees differ by at most 1.
The height of the whole tree is at most log₂(n).
At every node, the numbers of nodes in its two subtrees differ by at most 1.
Every leaf is at the same depth.
At every node, the heights of its two subtrees differ by at most 1.
Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!