+1 vote
in Data Structures & Algorithms I by (110k points)
An AVL tree is a self – balancing binary search tree, in which the heights of the two child sub trees of any node differ by _________

(a) At least one

(b) At most one

(c) Two

(d) At most two

My question comes from Binary Trees in chapter Binary Trees of Data Structures & Algorithms I

The question was posed to me in a national level competition.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Correct choice is (b) At most one

Easiest explanation - In an AVL tree, the difference between heights of the two child sub trees of any node is at most one. If the height differs by more than one, AVL tree performs rotations to balance the tree.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.