Data Structures and Algorithms |
8.2 General n-ary trees |
If we relax the restriction that each node can have only one key, we can reduce the height of the tree.
An m-way search tree
|
Or in plain English ..
|
The height of a complete m-ary tree with n nodes is ceiling(logmn).
A B-tree of order m is an m-way tree in which
Key terms |
Continue on to Hash Tables | Back to the Table of Contents |