1

B-tree of order n is a order-n multiway tree in which each non-root node contains

Correct Answer: at least (n – 1)/2 keys

Make the most of this question

This page focuses on one Data Structure (DS) question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

Data Structure (DS) MCQ: B-tree of order n is a order-n multiway tree in which each non-root node contains | Extra Education