TY  - BOOK
AU  - Sahni,Sartaj
TI  - Data structures, algorithms, and applications in Java
SN  - 007109217X (alk. paper)
SN  - 978007109
AV  - QA76.73.J38 .S24 
PY  - 2000///
CY  - Boston
PB  - McGraw-Hill
KW  - Java (Computer program language)
KW  - Data structures (Computer science)
KW  - Computer algorithms
KW  - Application software
KW  - Development
N1  - Includes Index; pt. I. Preliminaries --
Ch. 1. Java Review --
Ch. 2. Performance Analysis of Programs --
Ch. 3. Asymptotic Notation --
Ch. 4. Performance Measurement of Programs --
pt. II. Data Structures --
Ch. 5. Linear Lists --
Array Representation --
Ch. 6. Linear Lists --
Linked Representation --
Ch. 7. Linear Lists --
Simulated Pointers --
Ch. 8. Arrays and Matrices --
Ch. 9. Stacks --
Ch. 10. Queues --
Ch. 11. Skip Lists and Hashing --
Ch. 12. Binary and Other Trees --
Ch. 13. Priority Queues --
Ch. 14. Tournament Trees --
Ch. 15. Binary Search Trees --
Ch. 16. Balanced Search Trees --
Ch. 17. Graphs --
pt. III. Algorithm-Design Methods --
Ch. 18. The Greedy Method --
Ch. 19. Divide and Conquer --
Ch. 20. Dynamic Programming --
Ch. 21. Backtracking (On the Web) --
Ch. 22. Branch and Bound (On the Web)
ER  -