Arbyx
Stay balanced, no matter what you add.
What it is
Arbyx is an interactive B-tree visualiser that stays balanced through every insert and delete while showing its structure live. The signature technique is the textbook B-tree mechanics - split-on-insert and borrow-or-merge-on-delete - backed by a live invariant validator and a 1000-operation fuzz test cross-checked against a reference set, with every invariant verified after each step. It is a from-scratch, dependency-light build you can download and run locally.
A textbook B-tree (split-on-insert, borrow/merge-on-delete) with a live invariant validator. 12 tests, including a 1000-operation fuzz cross-checked against a reference set with every invariant verified after each step.
What's inside
The full source, the tests, and CI. Open it, read it, change it. A zero-dependency core, free, in the MIT spirit.
Run it after unzip
pnpm install && pnpm dev