A practical guide to data structures and algorithms using Java. (©2008)

• Record Type: Book
• Further Information: Note: Sally Goldman, Kenneth Goldman.
• Other Names: Goldman, Sally A (Sally Ann); Goldman, Kenneth J (Kenneth Jerome)
• Contents: Front cover; Contents; Preface; Acknowledgments; Authors; Part I. INTRODUCTION; Chapter 1. Design Principles; Chapter 2. Selecting an Abstract Data Type; Chapter 3. How to Use This Book; Part II. COLLECTION DATASTRUCTURES ANDALGORITHMS; Chapter 4. Part II Organization; Chapter 5. Foundations; Chapter 6 .Partition ADT and the Union-Find Data Structure; Chapter 7. Collection of Elements; Chapter 8. Abstract Collection; Chapter 9. Positional Collection ADT; Chapter 10. Abstract Positional Collection; Chapter 11. Array Data Structure; Chapter 12. Circular Array Data Structure. Chapter 13. Dynamic Array and Dynamic Circular Array Data StructuresChapter 14. Tracked Array Data Structure; Chapter 15. Singly Linked List Data Structure; Chapter 16. Doubly Linked List Data Structure; Chapter 17. Buffer ADT and Its Implementation; Chapter 18. Queue ADT and Implementation; Chapter 19. Stack ADT and Implementation; Chapter 20. Set ADT; Chapter 21. Direct Addressing Data Structure; Chapter 22. Open Addressing Data Structure; Chapter 23. Separate Chaining Data Structure; Chapter 24. Priority Queue ADT; Chapter 25. Binary Heap Data Structure. Chapter 26. Leftist Heap Data StructureChapter 27. Pairing Heap Data Structure; Chapter 28. Fibonacci Heap Data Structure; Chapter 29. Ordered Collection ADT; Chapter 30. Sorted Array Data Structure; Chapter 31. Abstract Search Tree Class; Chapter 32. Binary Search Tree Data Structure; Chapter 33. Balanced Binary Search Trees; Chapter 34. Red-Black Tree Data Structure; Chapter 35. Splay Tree Data Structure; Chapter 36. B-Tree Data Structure; Chapter 37. B+-Tree Data Structure; Chapter 38. Skip List Data Structure; Chapter 39. Digitized Ordered Collection ADT; Chapter 40. Trie Node Types. Chapter 41. Trie Data StructureChapter 42. Compact Trie Data Structure; Chapter 43. Compressed Trie Data Structure; Chapter 44. Patricia Trie Data Structure; Chapter 45. Ternary Search Trie Data Structure; Chapter 46. Spatial Collection ADT; Chapter 47. KD-Tree Data Structure; Chapter 48. Quad Tree Data Structure; Chapter 49. Tagged Collection ADTs; Chapter 50. Tagged Bucket Collection ADTs; Part III. GRAPH DATA STRUCTURES AND ALGORITHMS; Chapter 51. Part III Organization; Chapter 52. Graph ADT; Chapter 53. Abstract Graph and Graph Algorithms; Chapter 54. Adjacency Matrix Data Structure. Chapter 55. Adjacency List Data StructureChapter 56. Weighted Graph ADT; Chapter 57. Abstract Weighted Graph and Weighted Graph Algorithms; Part IV. APPENDICES; Appendix A; Appendix B; Appendix C; Index; Back cover.
• Publisher Details: Boca Raton : Chapman & Hall/CRC
• Publication Date: 2008
• Copyright Date: 2008
• Extent: 1 online resource (xxvii, 1026 pages), illustrations
• Subjects: 005.13/3; Java (Computer program language); Data structures (Computer science); COMPUTERS -- Programming Languages -- Java; Data structures (Computer science); Java (Computer program language); Electronic books
• Languages: English
• ISBNs: 9781420010336; 1420010336; 9781584884552
• Related ISBNs: 158488455X; 9781584884552
• Notes: Note: Includes bibliographical references (pages 997-1004) and index.; Note: Print version record.
• Access Rights: Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
• Access Usage: Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.