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 _________

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 _________ Correct Answer At most one

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.
Bissoy MCQ

Related Questions

Let X1, X2 be two independent normal random variables with means μ1, μ2 and standard deviations σ1, σ2 respectively. Consider Y = X1 - X2; μ1 = μ2 = 1, σ1 = 1, σ2 = 2, Then,
Consider the following system of equations in three real variables x1, x2 and x3
2x1 - x2 + 3x3 = 1
3x1 - 2x2 + 5x3 = 2
-x1 - 4x2 + x3 = 3
This system of equations has