有什么区别btw“Order”和“度”在树数据结构方面 [英] What is the difference btw "Order" and "Degree" in terms of Tree data structure

问题描述

维基百科还说出这一点

B树属性相对于学位 B树 这也可以在CLRS书中找到

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:

1. Every node has at most m children.
...

and 'Degree' is defined in Tree terms as:

Degree – number of sub trees of a node.

so, are they same thing? I cannot feel any difference.

解决方案

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.

B Tree properties with respect to the Order

Wikipedia also states this

B Tree Properties with respect to the Degree B Tree This can also be found in the CLRS book

这篇关于有什么区别btw“Order”和“度”在树数据结构方面的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！