$16.79
Add to Cart
Classic Data Structures in Java
More than 10 available
Details
Shipping: Australia: $66.00 (more destinations)
Condition: Brand new
*The store has not been updated recently. You may want to contact the merchant to confirm the availability of the product.
Publisher: Addison Wesley; US Ed edition (October 29, 2000)
Language: English
ISBN-10: 0201700026
ISBN-13: 978-0201700022
Product Description
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.
From the Back Cover
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.
Language: English
ISBN-10: 0201700026
ISBN-13: 978-0201700022
Product Description
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.
From the Back Cover
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.
CN, Jiangsu
