(Note: Each chapter begins with an Introduction and concludes with Pointers and Pitfalls, Review Questions and References). 1. Programming Principles. 2. Introduction to Software Engineering. 3. Lists. 4. Linked Lists. 5. Searching. 6. Tables and Information Retrieval. 7. Sorting. 8. Recursion. 9. Binary Trees. 10. Trees and Graphs. 11. Case Study: The Polish Notation. Appendix A: Mathematical Methods. Appendix B: Removal of Recursion. Appendix C: An Introduction to C.
