1. | Binary Tree ...作 定义:我们把满足以下两个条件的树型结构叫做二 叉树(Binary Tree): (1)每个结点的度都不大于2; (2)每个结点 … www.docin.com|Based on 2 pages |
2. | m fold n ary tree m重n叉树,m fold n ary... ... ) N-ary tree N叉树 ) m fold n ary tree m重n叉树 ) m_ary Tree m叉树 ... www.dictall.com|Based on 1 page |
3. | k-ary tree 如果一棵树的每个节点(除了叶子)都恰有k 个子孙,我们将其称为k 叉树(k-ary tree)。树型网络有着较小的直径, ,N 为 … www.docin.com|Based on 1 page |