5 10 25
3 4 6 8 14 23 24 27
11 13 17 18 19 20 21
m-Way searching :
• Similar to Binary searching
• If search item s<k1 search the leftmost child.
• If search item s>k(d-1), search the rightmost child
5 10 25
3 4 6 8 14 23 24 27
11 13 17 18 19 20 21
What would an in-order traversal look like :
22
5 10 25
3 4 6 8 14 23 24 27
11 13 17 18 19 20 21
3, 4, 5, 6, 8, 10, 11,13,14,17,18,19,20,21,22,23,24,25, 27
(2, 4) Tree
It is a kind of m-way search tree.
Properties 12
• At most 4 children
5
•All leaf are at same level 10 15
3 11
6 8
4
13 14 17
Insertion in m-way search tree :
STEPS :
• Search the node where the key is to be inserted.
• If the searched node is not full then insert the
key into that node.
7 12 80 92 141 262
X X X X X
7 12 80 92 141 262
X X X X X