Multi-Way Trees

From

← Binary Trees

↑ Tree ADTs

General Trees →

Multi-Way trees are trees that allow 0 or more children up to some fixed limit m for the entire tree; they are sometimes refered to as order m trees. When data are inserted or removed from a node, its number of child nodes changes. In order to maintain the pre-defined range, internal nodes may be joined or split. Because a range of child nodes is permitted, B-trees do not need re-balancing as frequently as other self-balancing search trees, but may waste some space, since nodes are not entirely full.

Multi-Way Tree Implementations

• B Trees
  
• B+ Trees
  

---

---