Redirected
473 views
1 votes
1 votes

2 Answers

0 votes
0 votes
the condition for B trees is it should be half filled so it will be ceil[m/2] and max it can be equal to m as there will be m pointers possible
0 votes
0 votes

 a B-tree of order m is a tree which satisfies the following properties:

Every node has at most m children.

Every non-leaf node (except root) has at least ⌈m/2⌉ children. The root has at least two children if it is not a leaf node.

so it has a minimum of m/2 children .. that means in between ⌈m/2⌉ and m

seems to be some printing mistake between A and D. answer will be ⌈m/2⌉ and m

edited by

Related questions

4 votes
4 votes
2 answers
1
VS asked Apr 9, 2017
410 views
0 votes
0 votes
1 answer
2
VS asked Apr 9, 2017
364 views
0 votes
0 votes
2 answers
3
VS asked Apr 9, 2017
285 views
0 votes
0 votes
2 answers
4
VS asked Apr 9, 2017
435 views