RJIT • B-Tree Visualizer (Order m)
Order m: max children per node = m, max keys per node = m−1. (Min keys ≈ ceil(m/2)−1, except root.) Current: m = 4
Operation: Ready
Focus node Split node Merge / Borrow (future)
Keys: 0
Instructions
  • Set the B-Tree order m (m ≥ 3, max children per node) and click Apply to create a new empty tree.
  • Enter a value and click Insert to insert into the B-Tree.
  • Delete works fully when the key lies in a leaf node (internal deletion is only explained, not implemented).
  • Use Find to locate a key. Print shows an in-order traversal (sorted keys).
  • SPLIT at key X banner appears when a node splits; animation slows slightly at splits.
← Back to DSA Hub
Output: —
© All rights reserved — RJIT, BSF Academy, Gwalior. Author: Dr. Jagdish Makhijani.