Optimal binary search trees meet object-oriented programming
Journal of Computing Sciences in Colleges
A recursive list paradigm with Java and C++ implementations
Journal of Computing Sciences in Colleges
CS2 and Java's comparator interface
Journal of Computing Sciences in Colleges
2D array implementation of sorted lists
ACM SIGCSE Bulletin
Hybrid and custom data structures: evolution of the data structures course
ITiCSE '09 Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education
Testing the jGRASP structure identifier with data structure examples from textbooks
Proceedings of the 46th Annual Southeast Regional Conference on XX
Making discrete mathematics relevant
Proceedings of the 48th Annual Southeast Regional Conference
| Hi-index | 0.00 |
From the Publisher:B With this book, Tim Budd looks at data structures by providing a solid foundation on the abstract data type (ADT), and uses the graphical elements found in Java when possible. The beginning chapters provide the foundation on which everything else will be built. These chapters define the essential concept of the ADT, and describe the tools used in the evaluation and analysis of data structures. The book moves on to provide a detailed description of the two most important fundamental data abstractions--the vector and the linked list--providing an explanation of some of the more common variations on these fundamental ideas. Next, the material considers data structures applicable to problems in which the order that values are added to a collection is important, followed by a consideration of the various different ways in which binary trees are used in the creation of data structures. The last few chapters consider a sequence of more advanced data structures. This book presents Java data structures to programmers interested in following a graphical approach.