@zqbinggong
2018-03-11T11:52:00.000000Z
字数 942
阅读 932
基本数据结构
散列表
二叉搜索树
红黑树
算法导论
A query that, given a set S and a key value k, returns a pointer x to an element in S such that x:key D k, or NIL if no such element belongs to S.
A modifying operation that augments the set S with the element pointed to by x. We usually assume that any attributes in element x needed by the set implementation have already been initialized.
A modifying 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.)
A query on a totally ordered set S that returns a pointer to the element of S with the smallest key.
A query on a totally ordered set S that returns a pointer to the element of S with the largest key.
A query that, given an element x whose key is from a totally ordered set S, returns a pointer to the next larger element in S, or NIL if x is the maximum element.
A query that, given an element x whose key is from a totally ordered set S, returns a pointer to the next smaller element in S, or NIL if x is the minimum element.