Q258
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
AnswerC.
Two
D.
At most two
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board