AVL Deletion

Deletion in AVL Trees

Deletion is almost similar to the insertion operation in AVLs with just one exception. The deletion operation adds an extra step after rotation and balances the first unbalanced node in the insertion method. After fixing the first unbalanced node through rotations, start moving up and fix the next unbalanced node. Keep fixing the unbalanced nodes until you reach the root.

Algorithm for deletion

Here is a high-level description of the algorithm for deletion.

1. Delete the given node

Delete the given node in the same way as BST deletion. At this point, the tree will become unbalanced. To rebalance the tree, you would need to perform some kind of rotation (left or right). At first, you will need to define the structure of the AVL tree and some nodes relative to the currentNode, which is inserted using step one.

2. Traverse upwards

Start traversing from the given node ...