原书出处
Introduction to Algorithms, Fourth Edition
12 第12章 二叉搜索树
y as to satisfy the binary-search-tree property: Let x be a node in a binary search tree.
If y is a node in the left subtree of x, then y.key ≤ x.key. If y is a node in the right subtree of x, then y.key ≥ x.key.
Thus, in Figure 12.1(a), the key of the root is 6, the keys 2, 5, and 5 in its left subtr
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter012.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea