In an AVL tree, node x has balance factor −2 (its right subtree is two levels taller than its left), and its right child has balance factor +1. The balance factor is height(left) − height(right).
How is the balance restored?

Question

In an AVL tree, node x has balance factor −2 (its right subtree is two levels taller than its left), and its right child has balance factor +1. The balance factor is height(left) − height(right).

How is the balance restored?

Answer

A single right rotation of  x

Answer

A right rotation of  x 's right child, then a left rotation of  x

Answer

A left rotation of  x 's right child, then a right rotation of  x

Answer

A single left rotation of  x

Crowdly

In an AVL tree, node x has balance factor −2 (its right subtree is two levels ...

Want instant access to all verified answers on learning.monash.edu?