B-Trees

A B-tree is a M-way search tree such that:
  1. It is perfectly balanced.

  2. Every node, except perhaps the root, is at least half full (has >= M values).
This tree is not a B-tree:
This one is, and contains the same values: