Data structures and algorithms in Java
The 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
40 pages matching subtree in this book
Results 1-3 of 40
What people are saying - Write a review
We haven't found any reviews in the usual places.
11 other sections not shown
Other editions - View all
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