This second edition of Data Structures: A Pseudocode Approach with C expands upon the solid, practical foundation developed in the first edition. A new four-part organizational structure is disigned to increase the flexibility of the text. Part I provides a general introduction and review, and the other parts delve deeply into data structures. In the same fashion, the binary tree chapter has been split into BST and AVL trees to allow professors to tailor these materials to thir requirements. As with the first edition, all material is presented in a clear, straightforward manner with many examples and visual diagtams designed to reinforce concepts.

Features
- Unique, two-fold approach teaches students how to design algorithms using pseudocode, and to then utilize this knowledge to build their own algorithms using C.
- New, four-part organization provides flexbility in presenting the course.
Visual focus, including over 300 figures, helps students to grasp difficult concepts.
- Problems in each chapter develop application skills by asking students to develop a pseudocode algorithm or write a short progam.
- Updated Exercise Sets allow opportrunities for student practice.
- Projects provide options for in-depth assignments.

Part 1 Introduction
Part 2 Linear Lists
Part 3 Non-Linear Lists
Part 4 sorting and Searching