中山大学数据结构课件Chapter7 Skip Lists and Hashing.pdfVIP

Chapter 7 Skip Lists and Hashing 信息科学与技术学院 黄方军 huangfj@mail.sysu.edu.cn 东校区实验中心B501 数据结构算法与应用 1 Bird’s-Eye View • Skip Lists • Hasing 数据结构算法与应用 2 7.1 Dictionaries •Collection of pairs. –(key, element) –Pairs have different keys. •Operations. –Search(k,x) –Insert(x) –Delete(k,x) 数据结构算法与应用 3 Application • Collection of student records in this class. – (key, element) = (student name, linear list of assignment and exam scores) – All keys are distinct. • Get the element whose key is John Adams. • Update the element whose key is Diana Ross. – Insert() implemented as update when there is already a pair with the given key. – Delete() followed by insert(). 4 Dictionary With Duplicates • Keys are not required to be distinct. • Word dictionary. – Pairs are of the form (word, meaning). – May have two or more entries for the same word. • (bolt, a threaded pin) • (bolt, a crash of thunder) • (bolt, to shoot forth suddenly) • (bolt, a gulp) • (bolt, a standard roll of cloth) • etc. 5 7.2 Linear List Representation • L = (e , e , e , e , …, e ) 0 1 2 3 n-1 • Each e is a pair (key, element). i • 5-pair dictionary D = (a, b, c, d, e). – a = (aKey, aElement), b = (bKey, bElement), etc. 数据结构算法与应用