原书出处
Introduction to Algorithms, Fourth Edition
B 附录B 集合等离散数学基础
of node 3 appear in a different order. Consider a node x in a rooted tree T with root r.
We call any node y on the unique simple path from r to x an ancestor of x. If y is an ancestor of x, then x is a descendant of y. (Every node is both an ancestor and a descendant of
itself.) If y is an ancestor of x and x ≠ y, then y is a proper ancestor of x and x is a
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix002.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea