原书出处
Introduction to Algorithms, Fourth Edition
B 附录B 集合等离散数学基础
tree with a node having no children. These leaf nodes are drawn as squares in the figure.
The tree that results is a full binary tree: each node is either a leaf or has degree exactly 2. No nodes have degree 1. Consequently, the order of the children of a node preserves the
position information. Figure B.7 Binary trees. (a) A binary tree drawn in a standard way.
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix002.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea