Data Structures and Algorithms · Trees

Balanced search trees

A BST that actively rebalances itself, AVL rotations or red-black coloring, so it never degrades into a line.

Also known as: AVL trees, red-black trees, tree rotations, 2-3 trees.

Start a lesson on Balanced search trees

Learn first

• Binary search trees: A binary tree kept ordered so each node's left subtree is smaller and right subtree is larger.

Related topics

• Segment trees: A binary tree over an array that answers range queries, like sum or minimum, in logarithmic time.