Interactive B-Tree Visualization

Visualize B-Tree insertions step by step with detailed explanations

Minimum Degree (t): 3

t=2t=3t=4t=5

Properties with t=3:

• Maximum keys per node: 5

• Minimum keys per node (non-root): 2

• Maximum children per node: 6

Enter Key(s)

📚 Example Question:

"Show the results of inserting the keys 20,30,35,85,10,55,60,25,5,65,70,75,15,40,50,80,45 in order into an empty B-tree. Use t=3, where t is the minimum degree of B-tree"

Click "Load Example" to automatically load these values, then use "Insert All" to see the solution!

👆 Configure and insert keys to start

Set minimum degree (t) and enter keys above

💡 Quick Start:

Set the minimum degree (t) using the slider
Click "Load Example" to load the sample question
Click "Insert All" to see the complete solution
Use Previous/Next buttons to review each step