Some questions have multiple answers please consider that

1. What is the motivation for using a B+ tree, as opposed to some other balanced tree (such as an AVL tree)? Select all that apply.

a None of the others

b No data is stored in the interior nodes making them desirable for database systems.

c A multi-way branch is easier to implement.

d The perfect balance of a B+ tree means greater efficiency.

e When the entire AVL tree won't fit in main memory, the increasing number of disk accesses is problematic.

2.Why do B+ trees have a minimum node size?

There is no minimum node size.

Requriing nodes to be half full guarantees that the tree does not degenerate into a simpe binary search tree.

There is no real advantage.

It is impossible to update the internal nodes if leaf nodes are not at least half full.