原书出处
Introduction to Algorithms, Fourth Edition
10 第10章 基本数据结构
ointer to the element. Figure 10.4(d) shows how an element is deleted from a linked list.
LIST-DELETE runs in O(1) time, but to delete an element with a given key, the call to LIST-SEARCH makes the worst-case running time be Θ(n).
LIST-DELETE(L, x) 1 if x.prev ≠ NIL 2 x.prev.next = x.next 3 else L.head = x.next 4 if x.
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter010.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea