Data Structures and Algorithms 
8.2 General nary trees 
If we relax the restriction that each node can have only one key, we can reduce the height of the tree.
An mway search tree

Or in plain English ..

The height of a complete mary tree with n nodes is ceiling(log_{m}n).
A Btree of order m is an mway tree in which
Key terms 
Continue on to Hash Tables  Back to the Table of Contents 