Muitiway Search Tree Definition/Meaning:  

Muitiway search tree of degree n. A generalization of a binary search tree to a tree of degree n where each node in the ordered tree has m ≤ n 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 + l)th subkey, where

i = 1,2,.....,m - 2

then the (i + l)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.

Near by Terms: Multiaccess System Multibus MULTICS  Multidimensional Array Multidrop Line Multilayer Device Multilevel Memory Multilevel Security Multilinked Multiple-Address Machine Multiple Assignment Multiple Precision (multiprecision) Multiple-Valued Logic (multivalued logic; non binary logic) Multiplexed Bus Multiplexer Multiplexing           Multiplier Multiply Connected Multipoint Connection      Multipoint Line Multiprocessing System (multiprocessor; multiple processor) Multiprogramming System Multitape Turing Machine Multitasking Multithreading Multiuser System Multivariate Analysis Multivibrator Muitiway Search Tree Mutual Exclusion