Data Structures & Algorithms in Java

Mitchell Waite, Robert Lafore1571690956, 9781571690951

Not filled with with obtuse mathematics and difficult proofs, MWSS:Data Structures and Algorithms in Java removes the mystique from DS&A. It does this in two ways. First, the text is written in a straightforward style, making it accessible to anyone. Second, unique new Java demonstration programs, called “Workshop Applets,” are provided with the book. These Workshop Applets provide interactive “moving pictures” which the user can control and modify by pressing buttons. The book’s text describes specific operations the user can carry out with these Workshop Applets, and the applets then reveal the inner workings of an algorithm or data structure.

---

Table of contents :
Cover……Page 1
Contents……Page 3
1. Overview……Page 11
2. Arrays (*FLAW*)……Page 29
3. Simple Sorting……Page 63
4. Stacks and Queues……Page 89
5. Linked Lists……Page 142
6. Recursion (*FLAW*)……Page 200
7. Advanced Sorting……Page 243
8. Binary Trees……Page 280
9. Red-Black Trees……Page 311
10. Other Trees……Page 335
11. Hash Tables……Page 372
12. Heaps……Page 416
13. Graphs……Page 438
14. Weighted Graphs……Page 476
15. When to Use What……Page 510
A: Running Programs……Page 521
B: Further Reading……Page 524