原书出处
Introduction to Algorithms, Fourth Edition
12 第12章 二叉搜索树
ree. Symmetrically, if k is larger than x.key, the search continues in the right subtree.
The nodes encountered during the recursion form a simple path downward from the root of the tree
, and thus the running time of TREE-SEARCH is O(h), where h is the height of the tree. Fig
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter012.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea