数据结构习题与解答—C++语言描述（英文版） (2008 年度畅销榜NO.49061 )

Chapter 1 Review of C++\r\n\r\n1.1 THE STANDARD C++ PROGRAMMING LANGUAGE\r\n1.2 CONDITIONALS\r\n1.3 OPERATORS\r\n1.4 ITERATION\r\n1.5 FUNCTIONS\r\n1.6 STRINGS\r\n1.7 FILES\r\n\r\nChapter 2 Pointers and Arrays\r\n\r\n2.1 POINTERS\r\n2.2 DERIVED TYPES\r\n2.3 REFERENCES\r\n2.4 PASSING BY REFERENCE\r\n2.5 NULL POINTER EXCEPTIONS\r\n2.6 THE new AND delete OPERATORS\r\n2.7 ARRAYS\r\n2.8 DYNAMIC ARRAYS\r\n2.9 PASSING AN ARRAY TO A FUNCTION\r\n2.10 MULTIDIMENSIONAL ARRAYS\r\n\r\nChapter 3 Classes\r\n\r\n3.1 A point CLASS\r\n3.2 INSTANCES,IMPLICIT ARGUMENTS,AND THE this POINTER\r\n3.3 COMPILING CLASSES AND THEIR CLIENT PROGRAMS\r\n3.4 FRIEND FUNCTIONS\r\n3.5 A Line CLASS\r\n3.6 A CLASS FOR RANDOM NUMBERS\r\n3.7 STATIC MEMEBRS\r\n3.8 COMPOSITION\r\n3.9 INHERITANCE\r\n\r\nChapter 4 Recursion\r\n\r\n4.1 THE FACTORIAL FUNCTION\r\n4.2 TRACING A RECURSIVE CALL\r\n4.3 THE FIBONACCI SEQUENCE\r\n4.4 BINOMIAL COEFFICIENTS\r\n4.5 THE EUCLIDEAN ALGORITHM\r\n4.6 INDUCTIVE PROOF OF CORRECTNESS\r\n4.7 COMPLEXITY ANALYSIS OF RECURSIVE ALGORITHMS\r\n4.8 DYNAMIC PROGRAMMING\r\n4.9 THE TOWERS OF HANOI\r\n4.10 MUTUAL RECURSION\r\n\r\nChapter 5 Stacks\r\n\r\n5.1 THE stack INTERFACE\r\n5.2 USING stack OBJECTS\r\n5.3 APPLICATIONS OF STACKS\r\n5.4 REMOVING RECURSION\r\n5.5 CONTIGUOUS IMPLEMENTATION\r\n5.6 LINKED IMPLEMENTATION\r\n\r\nChapter 6 Queues\r\n\r\n6.1 THE queue INTERFACE\r\n6.2 USING queue OBJECTS\r\n6.3 APPLICATIONS OF QUEUES\r\n6.4 CONTIGUOUS IMPLEMENTATION\r\n6.5 LINKED IMPLEMENTATION\r\n\r\nChapter 7 Lists\r\n\r\n7.1 THE list INTERFACE\r\n7.2 UNSING list OBJECTS\r\n7.3 ITERATORS\r\n7.4 APPLICATIONS\r\n7.5 CIRCULAR LISTS\r\n7.6 ORDERED LISTS\r\n7.7 AN UNBOUNDED Integer CLASS\r\n7.8 IMPLENENTION OF THE List CLASS\r\n\r\nChapter 8 Tables\r\n\r\n8.1 THE STANDARD pair TYPE\r\n8.2 APPLICATIONS USING THE map CLASS TEMPLATE\r\n8.3 HASH TABLES\r\n8.4 HASH FUNCTIONS\r\n8.5 SEPARATE CHAINING\r\n\r\nChapter 9 Trees\r\n\r\n9.1 TREE TERMINOLOGY\r\n9.2 DECISION TREES AND TRANSITION DIAGRAMS\r\n9.3 TREE TRAVERSAL ALGORITHMS\r\n9.4 A Tree CLASS INTERFACE\r\n9.5 IMPLEMENTATION OF THE Tree CLASS\r\n\r\nChapter 10 Trees\r\n\r\n10.1 DEFINITIONS\r\n10.2 COUNTING BINARY TREES\r\n10.3 FULL BINARY TREES\r\n10.4 IDENTITY,EQUALITY,AND ISOMORPHISM\r\n10.5 COMPLETE BINARY TREES\r\n10.6 TREE TRAVERSALS\r\n10.7 EXPRESSION TREES\r\n10.8 FORESTS\r\n10.9 A BinaryTree CLASS INTERFACE\r\n10.10 IMPLEMENTATION OF THE BinaryTree CLASS\r\n\r\nChapter 11 Search Trees\r\n\r\n11.1 BINARY SEARCH TREES\r\n11.2 IMPLEMENTATION OF BINARY SEARCH TREES\r\n11.3 PERFORMANCE CHARACTERISTICS OF BINARY SEARCH TREES\r\n11.4 AVL TREES\r\n\r\nChapter 12 Heaps and Priority Queues\r\n\r\n12.1 HEAPS\r\n12.2 THE NATURAL MAPPING\r\n12.3 INSERTION INTO A HEAP\r\n12.4 REMOVAL FROM A HEAP\r\n12.5 PRIORITY QUEUES\r\n12.6 USING priority_queue OBJECTS\r\n12.7 USING A HEAP TO IMPLEMENT A PriorityQueue CLASS TEMPLATE\r\n12.8 APPLICATIONS OF PRIORITY QUEUES\r\n\r\nChapter 13 Soring\r\n\r\n13.1 PRELIMINARIES\r\n13.2 THE BUBBLE SORT\r\n13.3 THE SELECTION SORT\r\n13.4 THE INSERTION SORT\r\n13.5 THE MERGE SORT\r\n13.6 THE QUICK SORT\r\n13.7 HEAPS\r\n13.8 THE HEAP SORT\r\n13.9 HTE SHELL SORT\r\n13.10 THE SPEED LIMIT FOR EXCHANGE SORTS\r\n\r\nAppendix A References\r\nAppendix B Essential Mathematics\r\n\r\nB.1 THE FLOOR AND CEILING FUNCTIONS\r\nB.2 LOGARITHMS\r\nB.3 THE FIRST PRINCIPLE OF MATHEMATICAL INDUCTION\r\nB.4 THE SECOND PRINCIPLE OF MATHEMATICAL INDUCTION\r\nB.5 GEOMETRIC SERIES\r\nB.6 SUMMATION FORMULAS\r\nB.7 ASYMPTOTIC COMPLEXITY CLASSES\r\nB.8 HARMONIC NUMBERS\r\nB.9 STIRLING'S FORMULA\r\nB.10 FIBONACCI NUMBERS\r\nB.11 THE GOLDEN MEAN\r\nB.12 THE EUCLIDEAN ALGORITHM\r\n\r\nAppendix C Standard Container Classes\r\n\r\nC.1 THE vector CLASS TEMPLATE\r\nC.2 THE deque CLASS TEMPLATE\r\nC.3 THE stack CLASS TEMPLATE\r\nC.4 THE queue CLASS TEMPLATE\r\nC.5 THE priority_queue CLASS TEMPLATE\r\nC.6 THE list CLASS TEMPLATE\r\nC.7 THE map CLASS TEMPLATE\r\nC.8 THE set CLASS TEMPLATE\r\n\r\nAppendix E Example Classes\r\n\r\nE.1 A BinaryTree CLASS\r\nE.2 A BinarySearchTree CLASS\r\nE.3 A Card CLASS\r\nE.4 A Concordance CLASS\r\nE.5 A Date CLASS\r\nE.6 A Deck CLASS\r\nE.7 A Hand CLASS\r\nE.8 A Hash FUNCTION STRUCTURE TEMPLATE\r\nE.9 A HashTable CLASS TEMPLATE\r\nE.10 A Line CLASS\r\nE.11 A List CLASS TEMPLATE\r\nE.12 A Matrix CLASS TEMPLATE\r\nE.13 AN OrderedList CLASS\r\nE.14 A Person CLASS\r\nE.15 A Point CLASS \r\nE.16 A Polynomial CLASS \r\nE.17 A PriorityQueue CLASS TEMPLATE\r\nE.18 A Purse CLASS\r\nE.19 A Queue CLASS \r\nE.20 A Random CLASS \r\nE.21 A RandomLine CLASS\r\nE.22 A RandomPoint CLASS\r\nE.23 A Ratio CLASS\r\nE.24 A Rational CLASS\r\nE.25 A SelfOrganizingList CLASS\r\nE.26 A Stack CLASS TEMPLATE\r\nE.27 A Tree CLASS \r\n\r\nIndex