Lecture 7 Greedy Algorithms II Computer Science讲座7贪心算法Ⅱ计算机科学.pptVIP

Lecture 12:Balanced Binary Search Trees Shang-Hua Teng Insertion and Deletion on dynamic sets Insert(S,x) A modifying operation that augments the set S with the element pointed by x Delete Given a pointer x to an element in the set S, removes x from S Notice that this operation uses a pointer to an element x, not a key value Querying on dynamic sets Search(S,k) given a set S and a key value k, returns a pointer x to an element in S such that key[x] = k, or NIL if no such element belongs S Minimum(S) on a totally ordered set S that returns a pointer to the element S with the smallest key Maxi