About The Solution
This second edition expands upon the solid, practical foundation established in the first edition of the text.
Additional Product Information
- Simplifies learning the design of algorithms using pseudocode with this non-theoretical and practical approach to teaching.
- Eases into a solid working knowledge of data structures by de-emphasizing the use of formal mathematical proofs.
- Enhances students' knowledge of the C programming language through building algorithms and trees.
- Reinforces concepts learned with fully updated exercises and projects at the end of every chapter.
Table of Contents
Part 1: Introduction
1. Basic Concepts
Part 2: Linear Lists
5. General Linear Lists
Part 3: Non-Linear Lists
6. Introduction to Trees
7. Binary Search Trees
8. AVL Search Trees
10. Multiway Trees
Part 4: Sorting and Searching
A: ASCII Tables
B: Structure Charts
C: Integer and Float Libraries
D: Selected C Libraries
E: Mathematical Series and Recursive Relations
F: Array Implementations of Stacks and Queues
All supplements have been updated in coordination with the main title. Select the main title’s "About the Solution" tab, then select "What's New" for updates specific to title's edition.
For more information about these supplements, or to obtain them, contact your Learning Consultant.
(ISBN-10: 0619216948 | ISBN-13: 9780619216948)
Custom learning materials let you create a digital or print course solution in the style and format best
for you and your learners. Maximize engagement and achieve desired outcomes with the aid of our academic and
digital experts, who have years of experience helping instructors customize material to specific course needs.
Create your custom solution »