#AVL

2026.09.27 10 min read

Four ways to keep a tree balanced

A search tree is only fast while it stays short, and there are surprisingly different ways to keep it that way: measure heights, colour nodes, roll dice, or give up on binary altogether. Add and delete values in all four and watch each one repair itself a step at a time.

• Data Structures
• Balanced Binary Tree
• AVL

Read article

2020.04.09 2 min read

Balanced binary tree animated

Balanced binary trees promise fast inserts, finds and deletes, and rotations are what keep the promise: they stop the tree from growing lopsided. Add and remove nodes here and watch each rotation play out one step at a time.

• Javascript
• CSS
• Balanced Binary Tree

Read article