AVL Trees and 2-3-4 Trees Quiz

What is the balance factor of a node in an AVL tree?

• The difference between the depths of the left and right subtrees

• The sum of the heights of the left and right subtrees

• The number of children a node has

• The height of the node itself

What is the valid range of balance factor in an AVL tree?

• [-2, 2]

• [-1, 1]

• [-3, 3]

• [0, 2]

Which rotation is required when a node is inserted into the left subtree of the left child?

• Right rotation

• Left rotation

• Left-right rotation

• Right-left rotation

Which type of rotation is performed for the Left-Right case in an AVL tree?

• Left rotation followed by right rotation

• Right rotation followed by left rotation

• Single right rotation

• No rotation required

What happens if the balance factor of a node becomes 2 after an insertion?

• No rebalancing is required

• Rebalancing occurs through rotation(s)

• The tree becomes invalid

• The node is deleted automatically

What happens during a single right rotation in an AVL tree?

• The left child becomes the new root, and the original root becomes its right child

• The right child becomes the new root, and the original root becomes its left child

• The tree is balanced without changing the root

• Only the balance factor is updated

Which operation might lead to a cascade of rotations in an AVL tree?

• Insertion

• Deletion

• Searching

• Traversal

How many keys can a single node in a 2-3-4 tree contain at most?

• 2

• 3

• 4

• None of the above

How many children can a 2-3-4 tree node with 3 keys have?

• 2

• 3

• 4

• None of the above

What happens when a node in a 2-3-4 tree becomes full (3 keys) during insertion?

• The tree stops accepting insertions

• The node is split into two nodes, and the middle key moves up

• The keys are rearranged to maintain balance

• The node is replaced by its children