Multiway Search Trees
Multiway search trees are basically search trees, just like Binary Search Trees except that they don’t have to be binary trees and each node can have more than one entries. Basically, a multiway tree node can have $n$ entries, which are stored in the node in an ordered manner. A node with $n$ entries can have $n+1$ children. The rule is that, the entries in the kth child needs to be between the values of $k-1$th and $kth$ entriesin the parent. Assuming ofcourse that $k_0=-\infty$ and $k_{n+1}=\infty$
