原书出处
Introduction to Algorithms, Fourth Edition
10 第10章 基本数据结构
of having a pointer to each of its children, however, each node x has only two pointers:
x.left-child points to the leftmost child of node x, and x.right-sibling points to the sibling of x immediately to its right.
If node x has no children, then x.left-child = NIL, and if node x is the rightmost child
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter010.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea