AVL Tree Concepts and Rotations

What type of tree is an AVL Tree?

• A completely unbalanced tree

• A balanced Binary Search Tree

• A general tree with no specific order

• A heap data structure

What is the maximum allowed difference in height between the left and right subtrees of any node in an AVL Tree?

• 0

• 1

• 2

• Any value

What is the height complexity of an AVL Tree, where 'n' is the number of nodes?

• O(n)

• O(n log n)

• O(log n)

• O(1)

What is the initial step when performing an insertion operation in an AVL Tree?

• Perform rotations to balance the tree immediately.

• Perform a standard Binary Search Tree (BST) insertion.

• Delete the root node.

• Traverse the tree in post-order.

If an imbalance occurs in an AVL Tree due to a Left Left case, which rotation is typically performed to rebalance it?

• Left Rotation

• Right Rotation

• Left-Right Rotation

• Right-Left Rotation

To resolve a Left Right case imbalance in an AVL Tree, what sequence of rotations is applied?

• Right Rotation, then Left Rotation

• Left Rotation, then Right Rotation

• Only a single Left Rotation

• Only a single Right Rotation

Which rotation is performed to rebalance an AVL Tree when a Right Right case imbalance occurs?

• Right Rotation

• Left Rotation

• Right-Left Rotation

• Left-Right Rotation

What sequence of rotations is used to correct a Right Left case imbalance in an AVL Tree?

• Left Rotation, then Right Rotation

• Right Rotation, then Left Rotation

• Only a single Left Rotation

• Only a single Right Rotation