Neural Ninjas Β· DSA Simulation Labs Β· Lab 26

πŸ“¦ The B-Tree Splitter

Each node holds several keys side by side. Force one past its capacity, and it snaps in half β€” the middle key jumps up to the parent, and the two halves become separate children. Every leaf always ends up at the exact same depth.

Insertion Log

Controls

πŸ“¦ NodeI can hold up to 2t-1 keys, side by side, always kept sorted. The moment a new key would make me hold 2t, I can't β€” I have to split.
⬆️ MedianWhen a node splits, I'm the one key that doesn't go left or right β€” I move straight up into the parent instead.
Pick a level above to begin.