原书出处
Introduction to Algorithms, Fourth Edition
B 附录B 集合等离散数学基础
, but the same when considered to be just rooted trees. B.5.3 Binary and positional trees
We define binary trees recursively. A binary tree T is a structure defined on a finite set of nodes that either contains no nodes, or is composed of three disjoint sets of nodes: a root
node, a binary tree called its left subtree, and a binary tree called its right subtree.
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix002.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea