B-Tree Insertion Visualizer
Insert unique numeric keys into a B-tree and inspect its structure.
Processing stays in your browser. Uses a standard B-tree with up to 100 unique keys. Displays the final tree; B+ trees, disk pages, deletion, and database storage are not modeled.
How to use the b-tree insertion visualizer
Insert unique numeric keys into a B-tree and inspect its structure. Complete the keys json array, minimum degree (2–5) fields above, or upload a UTF-8 text file for keys json array. Choose Run tool, review the output, then copy or download the result.
Example
A full root splits into a new root and two child nodes.
Good to know
Uses a standard B-tree with up to 100 unique keys. Displays the final tree; B+ trees, disk pages, deletion, and database storage are not modeled.