巴山夜雨1989

摘要： 12. binary search Trees The search tree data structure supports many dynamic-set operations,including search ,minimum,maximum,predecessor,successor ,insert ,and delete. Thus, we can use a se... 阅读全文

摘要： 11 Hash tables Many applications require a dynamic set that supports only the dictionary operations INSERT, SEARCH, and DELETE. For example, a compiler that translates a programming language mainta... 阅读全文