Question

please clear and direct anawar

Construct a B+ tree for the following set of key values under the assumption that the number of key values that fit in a node is 3.

Key values (3,10,12,14,29,38,45,55,60,68,11,30)

Show the step involved in inserting each key value.

Answer 1

Construct B+ tree with the no. of key values fitting into a node = 3 for following key values:

Key values are 3,10,12,14, 29, 38,45, 55, 60, 68, 11, 30.

Insertion Steps in B+ tree:

(1) Insert new element or node in a tree as a leaf node.

(2) If the leaf node reaches to max degree value then split this node and just copy the middle element or node to next level index node.

(3) If the index node reaches to max degree value then split this node and just copy the middle element or node to next index page.

B+ tree step by step:

(1) Insert 3:

(2) Insert 10:

(3) Insert 12:

(4) Insert 14:

(5) Insert 29:

(6) Insert 38:

(7) Insert 45:

(8) Insert 55:

(9) Insert 60:

(10) Insert 68:

(11) Insert 11:

(12) Insert 30: