B-Tree

A B-Tree is a self-balancing search tree designed to maintain sorted data and allow efficient insertion, deletion, and search operations. Unlike binary trees, each node can hold multiple keys and have more than two children. B-Trees are widely used in databases and file systems where large blocks of data must be read and written efficiently.

How it Works

• Insertion: A new key is inserted into the appropriate leaf node. If the node overflows (exceeds the maximum number of keys), it splits: the median key is pushed up to the parent, and the remaining keys form two child nodes. This process may propagate upward, potentially creating a new root.
• Splitting: Observe how existing keys are pushed down while the median key rises to the parent. This keeps the tree balanced — all leaves always remain at the same depth.