In a B-tree,the key values at each node are always in sorted order (i.e ascending or descending order).

Name: In a B-tree,the key values at each node are always in sorted order (i.e ascending or descending order).
Brand: Quizplus
Rating: 4.8 (42 reviews)

Question

Quizplus · Accepted Answer

In a B-tree, the keys are always maintained in sorted order, either in ascending or descending order. This property helps in efficient searching and insertion in a B-tree.

In a B-Tree,the Key Values at Each Node Are Always