原书出处
Introduction to Algorithms, Fourth Edition
B 附录B 集合等离散数学基础
es binary trees from ordered trees extends to trees with more than two children per node.
In a positional tree, the children of a node are labeled with distinct positive integers. The ith child of a node is absent if no child is labeled with integer i. A k-ary tree is a
positional tree in which for every node, all children with labels greater than k are miss
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix002.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea