Data Structures and Abstractions with JavaFor one- or two-semester courses in data structures (CS-2) in the departments of Computer Science, Computer Engineering, Business, and Management Information Systems. This is the most student-friendly data structures text available that introduces ADTs in individual, brief chapters -- each with pedagogical tools to help students master each concept. Using the latest features of Java 5, this unique object-oriented presentation makes a clear distinction between specification and implementation to simplify learning, while providing maximum classroom flexibility. |
Other editions - View all
Common terms and phrases
ADT list algorithm anEntry array-based implementation AVL tree base class beginning binary search tree binary tree chain of linked Chapter client clone CollegeStudent contains create currentNode data fields data type default constructor define derived class desk dictionary display efficiency empty example execution expression firstNode getEntry given in Segment givenPosition graph hash table hasNext heap Implement the ADT inner class insertion sort integer interface invoke isEmpty iterator Java Class Library left subtree linked chain linked implementation linked nodes LList loop merge sort method add mutator methods newEntry newNode nextIndex node null object operations param parameter path position priority queue private method Programming Tip public boolean public class public static public void Question recursive calls recursive method red-black tree reference result retrieve return true root search key sorted list stack statement String Task toString traversal tree in Figure variable vector vertex vertices write