multiway search tree

Show Summary Details

Quick Reference

Of degree n. A generalization of a binary search tree to a tree of degree n where each node in the ordered tree has


children and contains (m−1) ordered key values, called subkeys. for some given search key, if the key is less than the first subkey then the first subtree (if it exists) is searched for the key; if the key lies between the ith and (i + 1)th subkey, where

i = 1,2,…, m−2

then the (i + 1)th subtree (if it exists) is searched; if the key is greater than the last subkey then the mth subtree (if it exists) is searched. See also B-tree.

Subjects: Computing.

Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.