原书出处
Introduction to Algorithms, Fourth Edition
12 第12章 二叉搜索树
and DELETE. Thus, you can use a search tree both as a dictionary and as a priority queue.
Basic operations on a binary search tree take time proportional to the height of the tree.
For a complete binary tree with n nodes, such operations run in Θ(lg n) worst-case time.
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter012.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea