原书出处
Introduction to Algorithms, Fourth Edition
12 第12章 二叉搜索树
ITERATIVE-TREE-SEARCH procedure on the facing page is more efficient. Minimum and maximum
To find an element in a binary search tree whose key is a minimum, just follow left child pointers from the root until you encounter a NIL
, as shown in Figure 12.2(b). The TREE-MINIMUM procedure returns a pointer to the minimum
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter012.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea