Question

If the index entries are inserted in sorted order into a B+ tree, choose the incorrect option/s about the leaf nodes.
(a) The new entries get directed to last leaf node if the index entries are inserted in ascending order
(b) when last leaf node gets filled, it is split into two
(c) if the leaf node splits when inserting in ascending order, the right node is left untouched and the insertions takes place on the left node.
(d) Except for the first and last leaf, the occupancy of nodes is about 50 percent if inserted in ascending or descending order.

Answer 1

@ is the answer for this one!

Answer 2

(c) if the leaf node splits when inserting in ascending order, the right node is left untouched and the insertions take place on the left node.

Explanation:

The leaf node gets split into two nodes if it's getting filled. After the split, the left node gets untouched and the right node is the node where insertion takes place. The index entries get inserted in the last leaf node if the data is sorted in ascending order.

#SPJ3