数据结构(严蔚敏) Review.pptVIP

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
Chapter1--Concepts data structure resource constraints (Space Time) Definitions of data type Abstract Data Type data structure Problems, Algorithms and Programs Algorithm Properties Chapter3-- How to Measure Efficiency Asymptotic Algorithm Analysis Examples of Growth Rate (c1lognc2nc3nlognc4n2 c52nc6n! ) Big-oh、Big-? and Theta Confusing worst case with upper bound best case with lower bound Simplifying Rules Chapter4 --Lists List Sorted lists Unsorted lists List ADT--Array-Based List Class Linked List Class Space Comparison (See exercises) Stacks PUSH、 POP and TOP Stack ADT-- Array-Based Stack Class Linked Stack Class Queues Enqueue、Dequeue、Front、Rear Array-Based Queue Linked Queue Chapter5 --Binary Trees (1) Binary Tree Concepts and notations Full and Complete Binary Trees and two theorems Traversals– Preorder、Inorder and Postorder Array Implementation of complete binary tree Binary Tree Node Class and Implementation-- Union Implementation、Inheritance、Composite BST Property BST Property、BST ADT BST Search、Insert 、 Remove Minimum Value、 Remove、 Cost of BST Operations Heaps Property、ADT、Building the Heap、Remove Max Value Huffman Coding Trees ADT、Huffman Tree Construction、 Assigning Codes、Calculate Expected cost per letter Chapter6--General Trees Concepts General Tree Node and Implementations. General Tree Traversal Converting to a Binary Tree K-ary Trees Sequential Implementations (See exercises) Chapter7-- Sorting Concepts of sorting Insertion Sort and costs (in Best Case、Average Case and Worst Case) Bubble Sort and costs Selection Sort and costs Shellsort and costs Quicksort and costs Mergesort and costs Heapsort and costs Binsort and costs Radix Sort and costs Chapter8– file management vs. External Sorting Primary storage Secondary Storage Disk-based space/time tradeoff Disk Drives—platters、tract、sectors、 Interleaving factor、 Cluster、 Internal fragmentation Seek Time 、 Rotational Delay 、 Transfer time

文档评论(0)

today-is-pqsczlx + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档