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

Category: QuestionsB-tree of order n is a order-n multiway tree in which each non-root node contains __________
Editor">Editor Staff asked 5 months ago

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

(a) at most (n – 1)/2 keys

(b) exact (n – 1)/2 keys

(c) at least 2n keys

(d) at least (n – 1)/2 keys

Enquiry is from B-Trees in portion B-Trees of Data Structures & Algorithms I

This question was addressed to me during an interview for a job.

Editor">Editor Staff answered 5 months ago

Right choice is (d) at least (n – 1)/2 keys

The explanation is: A non-root node in a B-tree of order n contains at least (n – 1)/2 keys. And contains a maximum of (n – 1) keys and n sons.

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17
Articles: 40702