文件名称：Guide to Data Structures_A Concise Introduction Using Java-Springer(2017).pdf
文件大小：11.36MB
文件格式：PDF
更新时间：2021-01-24 15:53:32
Data Structures Java
After an overview of preliminary concepts, this text introduces stacks and queues using arrays along with a discussion of array-based lists. This is followed by an introduction to linked lists and the implementation of stacks and queues using references. Next, there is an introduction to binary trees, a discussion of various • Chapter 1 reviews and discusses various preliminary concepts. • Chapter 2 introduces stacks using arrays. • Chapter 3 illustrates queues using arrays. • Chapter 4 discusses lists using arrays. • Chapter 5 introduces lists using references and objects. • Chapter 6 examines linked lists. • Chapter 7 explores stacks and queues using references. • Chapter 8 introduces binary trees. • Chapter 9 explores sorting algorithms. • Chapter 10 discusses heaps. • Chapter 11 introduces hashing. • Appendix A contains a glossary of key terms. • Appendix B provides answers to selected exercises. Note that the above order is the authors’ preferred sequence; however, it is understood that some instructors, professionals, and independent students might want to pursue some topics in a different order. As given, all linked list structures follow the array-based structures, but alternatively, one could have Chaps. 5 and 6, following Chap. 1, and then, Chaps. 2–4 could be examined later. Further, parts of Chap. 9 can be introduced earlier at the instructor’s discretion. Of course, other combinations are possible given the preference of the instructor or the reader’s background.