Back to Playground

B+ Tree

Self-balancing tree used in database indexes

Insert keys to build the tree

Tree Properties

Order (max keys)3
Depth0

Legend

Internal Node
Leaf Node
Leaf Links

Activity

Insert keys to see activity

How B+ Trees Work:

  • Internal nodes store keys and pointers to children
  • Leaf nodes store actual data and are linked for range queries
  • All leaves are at the same depth (balanced)
  • When a node overflows, it splits and promotes a key to parent
  • Used in MySQL/InnoDB, PostgreSQL, and most database indexes