• a B-Tree is a tree designed to maintain balance
• by definition, a B-Tree of order $m$ has the following properties →
  • every node has at most $m$ children
  • every internal node has at least $\lceil \frac{m}{2} \rceil$ children
  • the root node has at least two children unless is is a leaf
  • all leaves appear on the same level
  • a non-leaf node with $k$ children contains $k-1$ keys

2-3 Tree

search

insert & split

delete