未找到相关数据
ON THE DEGREE PATH LENGTH OF TREES
被引：0
作者：
王振宇
[1
]
机构：
[1] Wuhan Digital Engincering Institute
来源：
关键词：
length;
tree;
ON THE DEGREE PATH LENGTH OF TREES;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
D. E. Knuth introduced in his book, "The Art of Programming" Vol. 3, the concept of degree path length of a tree. The degree path length of a tree is the sum, taken over all leaf nodes, of the internal-nodes degree on the path from the leaf to the root. In this letter, we will answer the following question: For any given integer n≥0, what is the total number of degree path length of all structurally different n-node binary trees, ternary trees, t-ary trees or ordered trees?
引用
收藏
页码：277 / 277
页数：1
相关论文