Chapter 12
Multi-way Trees

12.1 Definition

A m-way search tree is a tree in which

  1. The nodes hold between 1 to m-1 distinct keys
  2. The keys in each node are sorted
  3. A node with k values has k+1 subtrees, where the subtrees may be empty.
  4. The i’th subtree of a node [v1, ..., vk], 0 < i < k, may hold only values v in the range vi < v < vi+1 (v0 is assumed to equal - oo , and vk+1 is assumed to equal infty).
            |---|---|
            | 16 |18 |
          ---------- --
       ----            ----
    |---|              |------|
    --6-|              -22-26-|
   ||                --   |    --
  ||               ---   ||     ---
|---|            |---|  |--|  |---|---|
--4-|            -20-|  -24|  -28--30-|

A m-way tree of height h has between h and mh - 1 keys.

12.2 Insertions

12.3 Deletions