## Data Structures and Algorithms in JavaUsing a unique multimedia format for learning the fundamentals of data structures and algorithms, this conceptually elegant and innovative text incorporates the object-oriented design paradigm with Java as the implementation language. The result is a learning experience that provides the fundamental intuition and analysis of each structure studied. A Web site complete with Java applications and applets accompanies the text. Includes CD-ROM with... The Microsoft Visual J++ programming environment. |

### What people are saying - Write a review

#### Review: Data Structures and Algorithms in Java

User Review - Patrick Jennings - GoodreadsRequired for data structures class. I found better descriptions of the algorithms covered in this book on Wikipedia. At least the book contains Java code for some of the implementations and examples of how the data structures work. A good book for the beginner. You can find better as a reference. Read full review

#### Review: Data Structures and Algorithms in Java

User Review - Hosein - GoodreadsThis was one of in our syllabus which we had to read. this book is a great book which gives you the idea of how to code a queue for example or a stack which are very helpful for a big project. JAVA is ... Read full review

### Contents

Analysis Tools | 30 |

Stacks Queues and Linked Lists | 66 |

Sequences | 114 |

Copyright | |

19 other sections not shown

### Common terms and phrases

abstract data type analysis applet array asymptotic AVL tree binary search tree binary tree block boolean called chapter Code Fragment constant constructor container data structure defined deletion denote deque describe dictionary doubly linked list edges efficient empty enumeration Euler tour example executed external Figure function given hash heap height Input insertion instance variables integer interface internal node isEmpty iteration Java implementation Java Virtual Machine justification list structure loop memory merge-sort method methpo number of elements object-oriented design Output path perform position postorder traversal preorder traversal primitive operations priority queue problem Proposition protected void pseudo-code public class public void query queue ADT quick-sort random recursive red-black tree reference remove running Section sequence ADT shown in Code singly linked list skip list specific splay splay tree stack string structures and algorithms subtree rooted update vertex vertices worst-case