- Cover Page
- Title Page
- Copyright Page
- Dedication
- Contents
- Preface
- 1 Getting Organized
- 2 The Stack ADT
- 3 Recursion
- 4 The Queue ADT
- 4.1 The Queue
- 4.2 The Queue Interface
- 4.3 Array-Based Queue Implementations
- 4.4 An Interactive Test Driver
- 4.5 Link-Based Queue Implementations
- 4.6 Application: Palindromes
- 4.7 Queue Variations
- 4.8 Application: Average Waiting Time
- 4.9 Concurrency, Interference, and Synchronization
- Summary
- Exercises
- 5 The Collection ADT
- 6 The List ADT
- 7 The Binary Search Tree ADT
- 7.1 Trees
- 7.2 Binary Search Trees
- 7.3 The Binary Search Tree Interface
- 7.4 The Implementation Level: Basics
- 7.5 Iterative Versus Recursive Method Implementations
- 7.6 The Implementation Level: Remaining Observers
- 7.7 The Implementation Level: Transformers
- 7.8 Binary Search Tree Performance
- 7.9 Application: Word Frequency Counter
- 7.10 Tree Variations
- Summary
- Exercises
- 8 The Map ADT
- 9 The Priority Queue ADT
- 10 The Graph ADT
- 11 Sorting and Searching Algorithms
- Appendix A: Java Reserved Words
- Appendix B: Operator Precedence
- Appendix C: Primitive Data Types
- Appendix D: ASCII Subset of Unicode
- Glossary
- Index
To Alfred G. Dale
ND
To Kathy, Tom, and Julie, thanks for the love and support
DJ
To Lisa, Charlie, and Abby, thank you . . .
CW
-
No Comment
..................Content has been hidden....................
You can't read the all page of ebook, please click here login for view all page.