影印版--数据结构JAVA描述数据结构的设计原则与JAVA实现 (2008 年度畅销榜NO.41840 )

这是一本让读存在现代程序设计环境中学习如何生成和分析常用数据结构的教材。书中介绍了如何用Java语言设计与实现传统的数据结构。本书目下列情点：\r\n·用Java这一开放的、纯面向对象的语著作为描述语言。\r\n·采用面向对象方法来设计传统的数据结构；引入类、并面、继承、封装等思想。\r\n·全书结枸严谨，前后连接自然，内容简洁而又清晰。\r\n·使用适应于事物本易规律的方法来描述事物，亦即用对象、类这一封装了数据和操作的结构来描还数据组织。\r\n·不仅讲述了如何用Java实现数据结构且抽象出一般的设计原则掌握并灵活运用这些原则可以使读香受益非浅。\r\n·书中有50多个已实现并经过测试的类。这些类构成一个结构包，可以作为程序员编程的基础。\r\n·书中有大量实例，吉诉读著如何去使用定义好的数据结构。\r\n·每一章后有大量精心设计的提问，目以帮助读者复习和进一步提高。\r\n 本书适合于本科高年级学生使用。本书附录A虽有Java语言的简介，但对不熟悉Java语言的读者，建议最好在学习本书轭花上几周时间了解Java语言。

Preface \r\n\r\n0 Introduction\r\n0.1 Read Me\r\n0.2 He Cant Say That, Can He?\r\n\r\n1 The Object-Oriented Method\r\n1.1 Data Abstraction and Encapsulation\r\nl.2 The Object Model\r\n1.3 Object-Oriented Terminology\r\n1.4 Sketching an Example: A Word List\r\nl.5 A Special Purpose Class: A Bank Account\r\n1.6 AGeneral Purpose Class: An Association\r\n1.7 Interfaces\r\nl.8 Who Is the User?\r\nl.9 Conclusions\r\n\r\n2 Comments, Conditions, and Assertions\r\n2.1 Pre- and Postconditions\r\n2.2 Assertions\r\n2.3 Craftsmanship\r\n2.4 Conclusions\r\n\r\n3 Vectors\r\n3.1 Application: The Word List Revisited\r\n3.2 Application: Word Frequency\r\n3.3 The Interface\r\n3.4 The Implementation\r\n3.5 Extensibility: A Feature\r\n3.6 Application: The Matrix Class\r\n3.7 Conclusions\r\n\r\n4 Design Thndamentals\r\n4.1 Asymptotic Analysis Tools\r\n4.1.1 Time and Space Complexity\r\n4.1.2 Examples\r\n4.1.3 The Trading of Time and Space\r\n4.2 Self Reference\r\n4.2.1 Recursion\r\n4.2.2 Mathematical Induction\r\n4.3 Properties of Design\r\n4.3.1 Symmetry\r\n4.3.2 Friction\r\n4.4 Conclusions\r\n\r\n5 Sorting\r\n5.1 Approaching the Problem\r\n5.2 Selection Sort\r\n5.3 Insertion Sort\r\n5.4 Mergesort\r\n5.5 QuickPort\r\n5.6 Sorting Objects\r\n5.7 Vector-Based Sorting\r\n5.8 Conclusions\r\n\r\n6 Lists\r\n6.1 Example: A Unique Program\r\n6.2 Example: Free-Lists\r\n6.3 Implementation: Singly-Linked Lists\r\n6.4 Implementation: Doubly-Linked Lists\r\n6.5 Implementation: Circularly-Linked Lists\r\n6.6 Conclusions\r\n\r\n7 Linear Structures\r\n7.1 Stacks\r\n7.1.1 Example: Simulating Recursion\r\n7.1.2 Vector-Based Stacks\r\n7.1.3 List-Based Stacks\r\n7.1.4 Comparisons\r\n7.2 Queues\r\n7.2.1 Example: Solving a Coin Puzzle\r\n7.2.2 List-Based Queues\r\n7.2.3 Vector-Based Queues\r\n7.2.4 Array-Based Queues\r\n7.3 Example: Solving Mazes\r\n7.4 Conclusions\r\n\r\n8 Iterates 1\r\n8.1 Javas Enumeration Interface\r\n8.2 The Iterate Interface\r\n8.3 Example: Vector Iterates\r\n8.4 Example: List Iterates\r\n8.5 Example: Filtering Iterates\r\n8.6 Conclusions\r\n\r\n9 Ordered Structures\r\n9.1 Comparable Objects\r\n9.1.1 Example: Comparable Integers\r\n9.1.2 Example: Comparable Associations\r\n9.2 Keeping Structures Ordered\r\n9.2.1 The OrderedStructure Interface\r\n9.2.2 The Ordered Vector\r\n9.2.3 Example: Sorting\r\n9.2.4 The Ordered List\r\n9.2.5 Example: The Modified Parking Lot\r\n9.3 Conclusions\r\n\r\n10 These\r\nl0.1 Terminology\r\n10.2 TheInterface\r\nl0.3 Motivating Example: Expression Trees\r\n10.4 Implementation\r\nl0.4.1 The BinaryTreeNode Implementation\r\nl0.4.2 implementation of the BinaryTree Wrapper\r\n10.5 Traversals\r\nl0.5.1 Preorder Traversal\r\nl0.5.2 Ignored Traversal\r\nl0.5.3 Postured Traversal\r\nl0.5.4 Levelorder Traversal\r\n10.5.5 Recursion in Iterates\r\nl0.6 Property-Based Methods\r\n10.7 Example: Huffman Compression\r\n10.8 Conclusions\r\n\r\n11 Priority Queues\r\nl1.1 The Interface\r\n11.2 Example: Improving the Huffman Code\r\nl1.3 Priority Vectors\r\nll.4 A Heap Implementation\r\n1l.4.1 Vector-Based Heaps\r\nll.4.2 Example: Heapsort\r\n11.4.3 Skew Heaps\r\nl1.5 Example: Circuit Simulation\r\nl1.6 Conclusions\r\n\r\n12 Search knees\r\nl2.1 Binary Search Trees\r\n12.2 Example: Tree Sort\r\nl2.3 Implementation\r\n12.4 Splay Trees\r\nl2.5 Splay Tree Implementation\r\nl2.6 Conclusions\r\n\r\n13 Dictionaries\r\n13.1 TheInterface\r\nl3.2 Unit Cost Dictionaries: Hash Tables\r\nl3.2.1 Open Addressing\r\nl3.2.2 External Chaining\r\n13.2.3 Generation of Hash Codes\r\n13.2.4 Analysis\r\n13.3 Ordered Dictionaries and Tables\r\n13.4 Example: Document Indexing\r\n13.5 Conclusions\r\n\r\n14 Graphs\r\nl4.1 Terminology\r\nl4.2 The Graph Interface\r\n14.3 Implementations\r\nl4.3.1 Abstract Classes\r\n14.3.2 Adjacency Matrices\r\nl4.3.3 Adjacency Lists\r\n14.4 Examples: Common Graph Algorithms\r\nl4.4.1 Ratability\r\n14.4.2 Topological Sorting\r\n14.4.3 Transitive Closure\r\n14.4.4 All Pairs Minimum Distance\r\n14.4.5 Greedy Algorithms\r\nl4.5 Conclusions\r\n\r\nA A Sip of Java\r\nA.1 A First Program\r\nA.2 Declarations\r\nA.2.1 Primitive Types\r\nA.2.2 Reference Types\r\nA.3 Important Classes\r\nA.3.1 The roadster!n Class\r\nA.3.2 PrintStreams\r\nA.3.3 Strings\r\nA.4 Control Constructs\r\nA.4.1 Conditional Statements\r\nA.4.2 Loops\r\nA.5 Methods\r\nA.6 Inheritance and Subtyping\r\nA.6.1 Inheritance\r\nA.6.2 Subtyping\r\nA.6.3 Interfaces and Abstract Classes\r\nB Use of the Keyword Protected\r\nC Principles\r\nD Structure Package Hierarchy\r\nE Selected Answers\r\nIndex