3 votes 3 votes What is the difference between order and degree of a B-tree are they same or different Sanjay Sharma asked May 17, 2017 Sanjay Sharma 13.1k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
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. Angkit answered May 17, 2017 Angkit comment Share Follow See all 4 Comments See all 4 4 Comments reply ankit3009 commented Dec 17, 2021 reply Follow Share is this correct @adad20 ? 0 votes 0 votes Shoto commented Dec 17, 2021 reply Follow Share Degree is defined for vertex / node right? We can have minimal degree of a B tree which determines the lower bound of number of children while Order is the uppder bound i.e. maximal number of children a node can have in B-trees. 1 votes 1 votes ankit3009 commented Dec 17, 2021 reply Follow Share So, order means “max number of children” and degree means “minimum number of children”, right? @adad20 I know order means the number of child nodes or say the number of pointers it has to point other nodes/blocks. I don’t know about the degree. So, can I take the degree as “minimum number of children” 0 votes 0 votes Shoto commented Dec 17, 2021 reply Follow Share Yes Lower bound of number of children 2 votes 2 votes Please log in or register to add a comment.
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 pawan kumarln answered May 17, 2017 edited May 18, 2017 by pawan kumarln pawan kumarln comment Share Follow See all 0 reply Please log in or register to add a comment.
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) h8pathak answered Dec 6, 2017 h8pathak comment Share Follow See 1 comment See all 1 1 comment reply _shashi commented Jan 27, 2018 reply Follow Share thanks 0 votes 0 votes Please log in or register to add a comment.
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. mint answered Jul 22, 2019 mint comment Share Follow See all 0 reply Please log in or register to add a comment.