原书出处
Introduction to Algorithms, Fourth Edition
12 第12章 二叉搜索树
distinct, the successor of a node x is the node with the smallest key greater than x.key.
Regardless of whether the keys are distinct, we define the successor of a node as the next node visited in an inorder tree walk.
The structure of a binary search tree allows you to determine the successor of a node wit
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter012.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea