Balanced trees

Balanced search trees repair their shape as keys are inserted to keep search paths logarithmic.

Remember: Repair the shape; keep the order.

Example: Inserting 30,20,10 into an AVL tree rotates 20 to the root.

The interactive workspace loads here when JavaScript is available. You can still browse the learning notes and links above without it.