PadhaikoAll subjects

Past exam question: 2062 Baishakh (Regular / Back), Q4(a)

Data Structure and Algorithms · 2 marks

Open in the Padhaiko app

Topic: Balanced binary tree · Introduction to red-black tree · B-Tree: Need…

Question

Define AVL balance tree.

Solution

Definition of AVL Balanced Tree: An AVL tree (Adelson-Velsky and Landis) is a height-balanced Binary Search Tree in which, for every node , the Balance Factor

is restricted to . Whenever an insertion or deletion produces , single (LL, RR) or double (LR, RL) rotations rebalance the tree to keep height .

Answer:

An AVL tree is a self-balancing BST where every node's balance factor , maintained by LL, RR, LR, and RL rotations.

All past exam questions for Data Structure and Algorithms