B-Tree / LSM-Tree Visualizer

Insert, search, split, compact. Compare read-optimized vs write-optimized structures.

Insert and search keys to visualize how B-Trees, B+ Trees, and LSM-Trees organize data differently.

💡Insert keys to build the tree. Watch nodes split when they overflow. Switch to LSM-Tree to see how writes go to memtable first.

Order (3 → max 2 keys/node)

Insert keys to build the tree

Height

Nodes

Total Keys

Last Search