What is the difference btw “Order” and “Degree” in terms of Tree data structure

Question

B-Tree Definition they use the \'order\' term in :

According to Knuth\'s definition, a B-tree of order m is a tree which satisfies the following properties:
         


        

Answer 1

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. Whereas the Order represents the upper bound on the number of children. ie. the maximum number possible.

B Tree properties with respect to the Order

NOTE: Wikipedia also states these

B Tree Properties with respect to the Degree

B Tree Properties with respect to Degree

NOTE: These can also be found in the CLRS book