## Data structures and algorithms in JavaThe third edition of this conceptually elegant and pedagogically innovative text continues to incorporate the object-oriented design paradigm, using Java as the implementation language, while also providing intuition and analysis of fundamental data structures and algorithms. All of this is done in a clear, friendly writing style that uses visuals to introduce and simplify important analytic and mathematical concepts. * Entirely new chapter on recursion * Additional exercises on the analysis of simple algorithms * New case study on parenthesis matching and HTML validation |

### 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

Java Programming | 2 |

ObjectOriented Design | 56 |

Analysis Tools | 100 |

Copyright | |

11 other sections not shown

### Other editions - View all

Data Structures and Algorithms in Java Michael T. Goodrich,Roberto Tamassia No preview available - 2010 |

Data Structures and Algorithms in Java Michael T. Goodrich,Roberto Tamassia No preview available - 2004 |

### Common terms and phrases

Abstract Data Type array AVL tree big-Oh binary search tree BTPosition bucket array Code Fragment computing constructor data structure define denote deque Describe dictionary double doubly linked list edges element stored empty entry with key Euler tour example execution external node Figure function given heap height Input insert instance variables integer interface internal isEmpty iterator Java program left child list ADT list structure loop merge-sort method null number of elements number of nodes Output parameter perform position postorder traversal preorder traversal priority queue problem proper binary tree Proposition protected void pseudo-code public boolean public class public int public Object public static public void queue ADT quick-sort recursive call red-black tree reference remove removeMin right child root running Section sequence shown in Code singly linked list skip list splay tree splaying stack statement string subtree throws InvalidPositionException update vertex vertices worst-case