🗂️ B-Tree

How It Works

This page uses a B-Tree of order 4 (minimum degree 2). Every node stores up to three keys and four children.

• Insertion splits any full child on the way down so the recursive descent never enters a full node.
• Deletion borrows from siblings when possible, otherwise merges two minimum children around a separator key.
• Search follows the separator keys until it finds the target or reaches a leaf.