原书出处
Introduction to Algorithms, Fourth Edition
10 第10章 基本数据结构
c sets in which the element removed from the set by the DELETE operation is prespecified.
In a stack, the element deleted from the set is the one most recently inserted
: the stack implements a last-in, first-out, or LIFO, policy. Similarly, in a queue, the e
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter010.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea