Visualize how B-Trees maintain balance through splits and merges. Watch keys propagate upward during insertion and nodes consolidate during deletion, keeping the tree height-balanced for efficient disk-based access.
| Operation | Average | Worst | Description |
|---|---|---|---|
| Search | O(log n) | O(log n) | Binary search within each node |
| Insert | O(log n) | O(log n) | May require splits up to root |
| Delete | O(log n) | O(log n) | May require merges or redistributions |