This second edition expands upon the solid, practical foundation established in the first edition of the text. A new four-part organizational structure increases the flexibility of the text, and all material is presented in a straightforward manner accompanied by an array of examples and visual diagrams.
Part I: Introduction
Chapter 1 Basic Concepts
Chapter 2 Recursion
Part II: Linear Lists
Chapter 3 Stacks
Chapter 4 Queues
Chapter 5 General Linear Lists
Part III: Non-Linear Lists
Chapter 6 Introduction to Trees
Chapter 7 Binary Search Trees
Chapter 8 AVL Search Trees
Chapter 9 Heaps
Chapter 10 Multiway Trees
Chapter 11 Graphs
Part IV: Sorting and Searching
Chapter 12 Sorting
Chapter 13 Searching
Appendix A: ASCII Tables
Appendix B: Structure Charts
Appendix C: Integer and Float Libraries
Appendix D: Selected C Libraries
Appendix E: Mathematical Series and Recursive Relations
Appendix F: Array Implementations of Stacks and Queues