multi-way search trees learning objective in this we will study about multi-way search trees which are quite different from other binary search trees though the concept is similar to normal binary search treesbut -way search trees can store more than one key values in single node the starts with general description of -way search treesand then discusses in detail -way search trees such as treesbtreesand - trees introduction we have discussed that every node in binary search tree contains one value and two pointersleft and rightwhich point to the node' left and right sub-treesrespectively the structure of binary search tree node is shown in fig the same concept is used in an -way search tree which has values per node and subtrees in such treem is called the degree of the tree pointer to note that in binary search tree so it has one value pointer to value or key right sub-tree left sub-tree of the node and two sub-trees in other wordsevery internal node of an -way search tree consists of pointers to sub-trees figure structure of binary search tree node and contains keyswhere the structure of an -way search tree node is shown in fig pn- kn- pn figure structure of an -way search tree node in the structure shownp pn are pointers to the node' sub-trees and kn- are the key values of the node all the key values are stored in ascending order that iski ki+ for ps ps -