🌲

B-Tree Visualizer

Interactive visualization of B-Tree operations (Self-Balancing Search Tree).

About B-Trees

A B-tree is a self-balancing tree data structure that maintains sorted data and allows searches, sequential access, insertions, and deletions in logarithmic time. It's commonly used in databases and file systems.

Key Features:

Multi-way Tree: Each node can have multiple keys and children.
Balanced: All leaf nodes are at the same level.
Efficient: O(log n) time complexity for operations.
Order (t): Minimum degree that determines min/max keys per node.