An AVL tree is
A) a binary search tree in which the heights of the subtrees at each node differ by at most one
B) a binary tree in which the left and right subtree have heights that differ by at most one
C) a priority queue with a balance condition
D) a binary tree in which each child is greater than its parent

Question

Quizplus · Accepted Answer

An AVL tree is a binary search tree in which the heights of the subtrees at each node differ by at most one. It is a balanced tree, which ensures efficient searching, insertion, and deletion operations. In an AVL tree, the balance factor of each node is either -1, 0, or +1, where the balance factor is defined as the difference between the heights of the left and right subtree. If the balance factor of any node is greater than 1 or less than -1, the tree is rebalanced by performing rotations to restore the balance.

An AVL Tree Is