Chapter 0 Preface¶
Chapter 1 Introduction¶
Chapter 2 Mathematical Background¶
Chapter 3 Algorithm Analysis¶
- 3.1. Chapter Introduction
- 3.2. Problems, Algorithms, and Programs
- 3.3. Comparing Algorithms
- 3.4. Best, Worst, and Average Cases
- 3.5. Faster Computer, or Faster Algorithm?
- 3.6. Asymptotic Analysis and Upper Bounds
- 3.7. Calculating Program Running Time
- 3.8. Multiple Parameters
- 3.9. Space Bounds
- 3.10. Code Tuning and Empirical Analysis
- 3.11. Algorithm Analysis Summary Exercises
Chapter 4 Searching I¶
Chapter 5 Linear Structures¶
- 5.1. Chapter Introduction: Lists
- 5.2. The List ADT
- 5.3. Array-Based List Implementation
- 5.4. Linked Lists
- 5.5. Comparison of List Implementations
- 5.6. Doubly Linked Lists
- 5.7. List Element Implementations
- 5.8. Stacks
- 5.9. Linked Stacks
- 5.10. Freelists
- 5.11. Implementing Recursion
- 5.12. Queues
- 5.13. Linked Queues
- 5.14. Linear Structure Summary Exercises
Chapter 6 Design¶
Chapter 7 Binary Trees¶
- 7.1. Binary Trees Chapter Introduction
- 7.2. Binary Trees
- 7.3. Binary Tree as a Recursive Data Structure
- 7.4. Binary Tree Traversals
- 7.5. Implementing Tree Traversals
- 7.6. Information Flow in Recursive Functions
- 7.7. Binary Tree Node Implementations
- 7.8. Composite-based Expression Tree
- 7.9. Binary Tree Space Requirements
- 7.10. Binary Search Trees
- 7.11. Dictionary Implementation Using a BST
- 7.12. Binary Tree Guided Information Flow
- 7.13. Multiple Binary Trees
- 7.14. A Hard Information Flow Problem
- 7.15. Array Implementation for Complete Binary Trees
- 7.16. Heaps and Priority Queues
- 7.17. Binary Tree Chapter Summary
