What is the minimum number of keys contained in each non root node of a B-Tree of order 11?

Showing Answers 1 - 0 of 0 Answers

Manish jain

  • Aug 27th, 2011
 

10

  Was this answer useful?  Yes

Mohit Kumar

  • Sep 3rd, 2011
 

If the order of B tree is M
min. no. of keys is "M2" and maximum no. of keys are "M-1"
and the root node contains "1 to M-1".

Thank you

  Was this answer useful?  Yes

BAADAL

  • Sep 6th, 2011
 

IN B tree non leaf node say p can have m -1 keys where m is the no of sub tree of p and all leaf node can have n-1 key where n is the order of the tree.

  Was this answer useful?  Yes

Pooja Negi

  • Nov 14th, 2011
 

the root node of b-tree has (k-1) keys where k=order of tree where as any other node except root node has min {ceiling value of(k/2)} so the ans will be 6

  Was this answer useful?  Yes

Give your answer:

If you think the above answer is not correct, Please select a reason and add your answer below.

 

Related Answered Questions

 

Related Open Questions