Data Structures

and
Algorithm Analysis in C
(second edition)
Solutions Manual

Mark Allen Weiss

Florida International University

Preface
Included in this manual are answers to most of the exercises in the textbook Data Structures and
Algorithm Analysis in C, second edition, published by Addison-Wesley. These answers reflect
the state of the book in the first printing.
Specifically omitted are likely programming assignments and any question whose solution is pointed to by a reference at the end of the chapter. Solutions vary in degree of completeness; generally, minor details are left to the reader. For clarity, programs are meant to be
pseudo-C rather than completely perfect code.
Errors can be reported to weiss@fiu.edu. Thanks to Grigori Schwarz and Brian Harvey
for pointing out errors in previous incarnations of this manual.

Table of Contents

1. Chapter 1: Introduction ......................................................................................................

2. Chapter 2: Algorithm Analysis ..........................................................................................

3. Chapter 3: Lists, Stacks, and Queues .................................................................................

4. Chapter 4: Trees .................................................................................................................

14

5. Chapter 5: Hashing ............................................................................................................

25

6. Chapter 6: Priority Queues (Heaps) ...................................................................................

29

7. Chapter 7: Sorting ..............................................................................................................

36

8. Chapter 8: The Disjoint Set ADT .......................................................................................

42

9. Chapter 9: Graph Algorithms .............................................................................................

45

10. Chapter 10: Algorithm Design Techniques ......................................................................

54

11. Chapter 11: Amortized Analysis ......................................................................................

63

12. Chapter 12: Advanced Data Structures and Implementation ............................................

66

-iii-