Which Statement Is True About B-Trees

Multiple Choice

Which statement is true about B-trees?

A) Traversals of a table can be done in sorted order more efficiently than a hash table.
B) All nodes are children of the root.
C) The root node contains either the largest or smallest key value.
D) If there are n nodes in the B-tree,then the height of the tree is log2 n.