Data structures using Java

For a two-semester introductory level course in data structures and programming. Based on the firm conviction that a first course in data structures must go hand in hand with a second course in programming, this text introduces abstract concepts, shows how those concepts are useful in problem solving, and then shows the abstractions can be made concrete by using a programming language. Equal emphasis is placed on both the abstract and the concrete versions of a concept, so that the student learns about the concept itself, its implementation, and its application.

INTRODUCTION TO DATA STRUCTURES. Information and Meaning. Arrays, Strings, and Vectors in Java. Classes and Objects in Java. THE STACK. Definitions and Examples. Representing Stacks in Java. Example: Infix, Postfix and Prefix. Stack of Objects of Varying Types. RECURSION. Recursive Definition and Processes. Recursion in Java. Writing Recursive Programs. Simulating Recursion. Efficiency of Recursion. QUEUES AND LISTS. The Queue and its Sequential Representation. Linked Lists. Lists in Java. Lists in Java. An Example: Simulation Using Linked Lists. Other List Structures.TREES Binary Trees. Binary Tree Representations. An Example: The Huffman Algorithm. Representing Lists as Binary Trees. Trees and Their Applications. Example: Game Trees.SORTING. General Background. Exchange Sorts. Selection and Tree Sorting. Insertion Sorts. Merge and Radix Sorts SEARCHING. Basic Search Techniques. Tree Searching. General Search Trees. Hashing. GRAPHS AND THEIR APPLICATIONS. Graphs. Flow Problem. Links Representation of Graphs. Graph Traversal and Spanning Forests. STORAGE MANAGEMENT. General Lists. Automatic List Management. Dynamic Memory Management.