原书出处
Introduction to Algorithms, Fourth Edition
12 第12章 二叉搜索树
eft subtree is no larger than 5, and the key 5 in its right subtree is no smaller than 5.
Because of the binary-search-tree property, you can print out all the keys in a binary search tree in sorted order by a simple recursive algorithm
, called an inorder tree walk, given by the procedure INORDER-TREE-WALK. This algorithm is
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter012.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea