原书出处
Introduction to Algorithms, Fourth Edition
10 第10章 基本数据结构
tore pointers to the parent, left child, and right child of each node in a binary tree T.
If x.p = NIL, then x is the root.
If node x has no left child, then x.left = NIL, and similarly for the right child. The ro
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter010.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea