Open Data Structures (in Java)

Pat Morin

Date: Edition 0.1E

• Acknowledgments
• Why This Book?
• Contents
• 1. Introduction
• 2. Array-Based Lists
• 3. Linked Lists
• 4. Skiplists
• 5. Hash Tables
• 6. Binary Trees
• 7. Random Binary Search Trees
• 8. Scapegoat Trees
• 9. Red-Black Trees
• 10. Heaps
• 11. Sorting Algorithms
• 12. Graphs
• 13. Data Structures for Integers
• 14. External Memory Searching
• Bibliography
• About this document ...