Interactive application
Interactive
Overview · selected highlights
Seven search trees
One ordered set, seven ways to maintain it. Run identical input through the trees and compare evolving shape, lookup depth and structural edits; the experiment isolates the local balancing choices later used inside larger algorithms such as Fortune's sweep.
InsertBalanceSearch
- [ ]
Share the input
Give every tree the same ordered-set operations.
- ⌘
Apply the rule
Each structure restores its own invariants through local changes.
- ↕
Compare the shapes
Watch paths, depths and structural differences emerge.
- Δ
Read the costs
Interpret lookup depth and edit counts alongside the evolving tree.
A controlled building-block comparison connects data-structure rules to observable consequences.
