原书出处
Introduction to Algorithms, Fourth Edition
B 附录B 集合等离散数学基础
ts root. The height of a tree is also equal to the largest depth of any node in the tree.
An ordered tree is a rooted tree in which the children of each node are ordered. That is, if a node has k children, then there is a first child, a second child,
and so on, up to and including a kth child. The two trees in Figure B.6 are different whe
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix002.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea