AVL Tree Concepts and Properties

What type of binary search tree is an AVL Tree?

• Unbalanced

• Balanced

• Complete

• Full

What is the maximum allowed height difference 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 first step when inserting a node into an AVL Tree?

• Perform a rotation to balance the tree.

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

• Check the balance factor of all nodes.

• Delete the root node.

Which rotation is performed to rebalance an AVL Tree in a Left Left case?

• Left Rotation

• Right Rotation

• Left-Right Rotation

• Right-Left Rotation