Q22

MCQMarks unknown

We wish to construct a $B^+$ tree with fan-out (the number of pointers per node) equal to $3$ for the following set of key values: $80, 50, 10, 70, 30, 100, 90$ Assume that the tree is initially empty and the values are added in the order given.

(A)

Show the tree after insertion of $10$ , after insertion of $30$ , and after insertion of $90$ . Intermediate trees need not be shown.

(B)

The key values $30$ and $10$ are now deleted from the tree in that order show the tree after each deletion.

Loading…