Balancing operations– AVL rotations

After inserting or removing nodes from the AVL tree, we will calculate the height of the nodes and will verify whether the tree needs to be balanced. There are two balancing processes that can be used: simple rotation or double rotation. Between simple rotation and double rotation, there are four scenarios:

  • Left-Left (LL): This is a single rotation to the right
  • Right-Right (RR): This is a single rotation to the left
  • Left-Right (LR): This is a double rotation to the right (rotate left then right)
  • Right-Left (RL): This is a double rotation to the left (rotate right then left)

Get Learning JavaScript Data Structures and Algorithms - Third Edition now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.