Data Representation Methods - Ithaca College, Ithaca, NY数据表示方法-伊萨卡学院，伊萨卡，纽约.pptVIP

下载本文档

1
0
约1.77万字
约 72页
2018-05-15 发布于江西
举报
版权申诉

Data Representation Methods - Ithaca College, Ithaca, NY数据表示方法-伊萨卡学院，伊萨卡，纽约.ppt

1、本文档共72页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
5、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
6、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
7、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
8、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Data Representation Methods - Ithaca College, Ithaca, NY数据表示方法-伊萨卡学院，伊萨卡，纽约.ppt

Balanced Binary Search Trees height is O(log n), where n is the number of elements in the tree AVL (Adelson-Velsky and Landis, 1962) trees (binary tree, internal memory applications) red-black trees (binary tree, internal memory) get, put, and remove take O(log n) time Balanced Binary Search Trees Indexed AVL trees Indexed red-black trees Indexed operations also take O(log n) time Balanced Search Trees weight balanced binary search trees B-tree degree 2, external memory applications (eg DB) 2-3 trees etc. Dictionary Structures Hashing In practice hashing will outperform balanced search trees for search, insert, delete. Balanced search trees used only when must guarantee a worst case time. Balanced ST used when search and delete done by rank. Balanced ST used when operations are not done by exact key match (eg, find smallest element with key larger than k). Comparing Search Trees Run-time performance of AVL and red-black trees similar. Splay trees take less time to perform a sequence of u operations. Splay trees easier to implement. Comparing Search Trees AVL and red-black trees use “rotations” to maintain balance. AVL perform 1 rotation after an insert and O(log n) rotations after a delete. red-black trees perform a single rotation following either an insert or delete. In most applications a rotation takes Q(1) time so difference is not important. In advanced applications rotations cannot be performed in constant time. Example: balanced priority search trees of McCreight. Represent 2D arrays. Each rotation costs O(log n). RBT: insert/delete remain at O(log n). AVL: insert O(log n) but delete is O(log2 n). Comparing Search Trees AVL, red-black, splay trees good when dictionary can fit into main memory. B-tree good when dictionary is so large that it must be kept on disk. In this case want high degree and smaller height. Implementation Some Java code available on web site (as solution to exercises). The classes java.util.TreeMap and java.util.Tre