Question

8. ( 10 points) Show the B-trees of order four resulted from loading the following sets of keys (each letter is a key) in order a.CGJX b. CGJXNSUOAEBHI c.CGJXNSUOAEBHIF d. CGJXNSUOAEBHIFKLQRTVUW z

Answer 1

In B-Tree of order 4 .Each node has at most 4 pointers and 3 keys. if kay are getting more than 3 then it get splitted.

8.a

8.b

As all the key is sameup to "X" so procedure is same as in question subpart 8.a ,so after inserting "N" key value

INSERTING "S"

INSERTING "U"

INSERTING "O"

INSERTING "A"

INSERTING "E"

INSERTING "B"

INSERTING "H"

INSERTING "I"

8.c

As all the key is sameup to "I" so procedure is same as in question subpart 8.b ,so after inserting F key value B-tree look like as follows:-

INSERTING "F"

8.d

As all the key is sameup to "F" so procedure is same as in question subpart 8.c , after that B-tree as follow

INSERTING "K"

INSERTING "L"

INSERTING "Q"

INSERTING "R"

INSERTING "T"

INSERTING "V"

INSERTING "U"

INSERTING "W"

INSERTING "Z"