🌳 B+ Tree Database Index Simulator

Interactive visualization of B+ tree operations and database indexing

← Back to Projects

⚡ Quick Start

Try This Sequence:

Click "Sequential Insert" to see splitting
Search for key 15 to see path traversal
Delete keys to observe merging

Visual Guide:

🔵 Internal nodes (indexes)
🟡 Leaf nodes (actual data)
🟠 Sibling pointers (range queries)

Tip: Use Order 3 for clearer visualization of splits and merges

Order: Pointers

Tree Height

1

Total Nodes

1

Leaf Nodes

1

Total Keys

0

Fill Factor

0%

I/O Operations

0

B+ Tree Properties

All data is stored in leaf nodes
Leaf nodes are linked for efficient range queries
Internal nodes only store keys for navigation
Tree remains balanced after insertions and deletions
Order determines max children per node (min is ⌈order/2⌉)

B+ Tree initialized with order 4