DSA Balanced Trees Visualizer

Insert values into a binary search tree one at a time and watch it take shape — every comparison on the way down, and the three cases that removal has to handle. AVL, red-black, and 2-3 trees follow in the next increments.

Insert and remove

Value

Several at once

Course examples

Each one clears the tree first and inserts from scratch.

Nodes: 0 of 24

Height: —

The tree is empty — insert a value, or load a course example, to begin.

Insert a value, or load one of the course examples.

step 0 / 0