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.

Question

Quizplus · Accepted Answer

B-trees are designed to facilitate sorted order traversal of their elements efficiently, unlike hash tables which do not maintain any order of the elements. This makes operations like range queries much faster in B-trees.

Which Statement Is True About B-Trees