AVL Tree

About

A self-balancing Binary Search Tree where the height of the left and right subtrees differ by at most 1.

Is more aggressive in maintaining the Tree balanced, since it may have more rotations and more complex rotations. (Compared to the Red-Black Tree)

Preferred in specific cases, where the aggressive balance maintainence is required.

Balance Rules

Searching an element

Has a better search time than Red-Black Trees.

Inserting an element

Deleting an element