13,059 views
3 votes
3 votes
What is the difference between order and degree of a B-tree

are they same or different

4 Answers

3 votes
3 votes
Order of B-tree defines (max and min) no. of children.

Degree of B-tree defines (max and min) no. of keys .

Degree is defined as minimum degree of B-tree.
2 votes
2 votes

Degree represents the lower bound on the number of children a B Tree can have (except for the root). i.e the minimum number of children possible. Whereas the Order represents the upper bound on the number of children. ie. the maximum number possible.

http://stackoverflow.com/questions/28846377/what-is-the-difference-btw-order-and-degree-in-terms-of-tree-data-structure

edited by
2 votes
2 votes

You can refer my answer here. 

https://stackoverflow.com/questions/28846377/what-is-the-difference-btw-order-and-degree-in-terms-of-tree-data-structure

Degree represents the lower bound on the number of children a node in the B Tree can have (except for the root). i.e the minimum number of children possible.  (Wikipedia uses this)

Whereas the Order represents the upper bound on the number of children. ie. the maximum number possible. (CLRS Book uses this)

0 votes
0 votes

A  B-Tree of maximum degree k:

All interior nodes have ⌈k/2⌉ to k children.

All nodes have ⌈k/2⌉ − 1  to  k − 1 keys.  Source University of San Francisco

while The maximum number of keys in a record(each node except for the root) is called the order of the B+ tree. source link wiki

 

Note: The terms Order and Degree are same for both B and B+ Trees.

Related questions

0 votes
0 votes
2 answers
1
1 votes
1 votes
1 answer
2
_shashi asked Jan 27, 2018
638 views
what is the difference between *b[10] and (*b)[10] ?