Database Reference
In-Depth Information
Example 10:
Figure
A1-20
illustrates how the heap of Example 9 would be processed
to yield a sorted list.
Figure A1-20.
Illustrating Heap-sort
A1.7 M-Way Search Trees and B-Trees
An m-way search tree is a tree in which each node has out-degree £ m. The out-degree
of a node is the number of sub-trees that it has. Figure
A1-21
illustrates an m-way search
tree in which the root has out-degree 2, the left node has out-degree 3 and the right node
has out-degree 3. The leaves (always) have out-degree 0. Figure
A1-22
illustrates a 3-way
search tree.