Multiway Search Trees (of order m)

• A generalization of binary search trees.

• Each node has at most m children.

• If k m is the number of children, then the node has exactly k-1 keys.

• The tree is ordered.

Previous slide

Next slide

Back to first slide

View graphic version