1. Advanced Data Structure using C++

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
• External nodes are empty
Figure 6.1: A multiway search tree with a successful search path for the number
6 (in green), and an unsuccessful search path for the number 26 (in red)
Searching
Searching in a general multiway search tree is analogous to searching in a binary
search tree. Starting at the root, we trace a path in T as follows:
1. For a d‐node v, compare the sought key with the keys k1,...,kd‐1 stored at
v.
2. If k is found then the search is a SUCCESS.
3. Otherwise return to step 1 using the child vi such that ki‐1