原书出处
Introduction to Algorithms, Fourth Edition
第三部分 数据结构
odifying operation that, given a pointer x to an element in the set S, removes x from S. (
Note that this operation takes a pointer to an element x, not a key value.
) MINIMUM(S) and MAXIMUM(S) Queries on a totally ordered set S that return a pointer to th
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/part003.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea