Data structures using Pascal / Aaron M. Tenenbaum, Moshe J. Augenstein.

CONTENT

1. Introduction to data structures
1. Information and meaning
2. Arrays and sets in Pascal
3. Records in Pascal

2. The stack
1. Definition and examples
2. Representing stacks in pascal
3. An example: Infix, postfix, and prefix

3. Recursion
1. Recursive definition and processes
2. Recursion in Pascal
3. Writing recursive programs
etc.

4. Queues and lists
1. The queue and its sequential representation
2. Linked lists
3. An example: Simulation using linked lists
4. Other list structures

5. Pascal list processing
1. Implementing lists using dynamic storage
2. An example: An airline reservation system
3. An example: Sparse matrices

6. Trees
1. Binary trees
2. Binary tree representations
3. An example: The Huffman algorithm
etc.

7. Sorting
1. General background
2. Exchange sorts
3. Selection and tree sorting
etc.

8. Searching
1. Basic search techniques
2. Tree searching
3. General search trees
4. Hashing

9. Graphs and their applications
1. Graphs
2. A flow problem
3. The linked representation of graphs
4. Graph traversal and spanning forests

10. Storage management
1. General lists
2. Automatic list management
3. Dynamic memory management

Bibliography and references : p. 754-767 . _ Index : p. 768-774.