An AVL tree keeps itself balanced after insertions by performing:

Question

Accepted Answer

A. Rotations

1. Nodes are rearranged when the balance rule breaks.
2. The rearrangement moves a node up and another down.
3. Those moves are rotations.
_Source: OpenStax Introduction to Computer Science, Chapter 3, Data Structures and Algorithms._

Answer

Reductions

Answer

Reflections

Answer

Repetitions

An AVL tree keeps itself balanced after insertions by performing:

Keep practising Data Structures and Algorithms