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

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