• Internal node: m keys, m+1 pointers to child nodes.

  • Leaf node: m full records: (key, value).

  • Pointer preceding key k: Child node keys < k.

  • Pointer following key k: Child node keys ≥ k.

  • Leaves are doubly-linked: Enables complete traversal in key order, in either direction.