This introduction to data structures using the C programming language treats structured problem solving, data abstraction, software engineering principles and the comparative analysis of algorithms as fundamental tools of program design. The book takes special care in the formulation of ideas into algorithms and in the refinement of algorithms into concrete programs that can be applied to practical problems. Special Features Stresses recursion through a range of applications and development of criteria for use.????????? Includes case studies that integrate various topics into programs of realistic size.????????? Discusses major principles of software engineering and applies them to large programming projects.????????? Emphasizes the process of data abstraction and abstract data types (ADT), separating ADTs from implemen-tation decisions.New to this edition:????????? All programs revised to emphasize data abstraction, develop and employ reusable code, and to strengthen uniformity and elegance of style.????????? Offers Internet access to the source code for all the programs and program extracts in the text.????????? Recursion treated much earlier in the tent and emphasized by repeated use thereafter.????????? Coverage of more advanced, modern topics: splay trees, red-black trees, amortized algorithm analysis. Table of Contents    1. Programming Principles.  2. Introduction to Software Engineering.  3. Stacks and Recursion.  4. Queues and Linked Lists.  5. General Lists.  6. Searching.  7. Sorting.  8. Tables and Information Retrieval.  9. Binary Trees. 10. Multiway Trees. 11. Graphs. 12. Case Study: The Polish Notation. Appendix A. Mathematical Methods. Appendix B. Removal of Recursion. Appendix C. An Introduction to C. Index.