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. Lower Bounds and \(\Theta\) Notation
- 3.8. Calculating Program Running Time
- 3.9. Analyzing Problems
- 3.10. Common Misunderstandings
- 3.11. Multiple Parameters
- 3.12. Space Bounds
- 3.13. Code Tuning and Empirical Analysis
- 3.14. Algorithm Analysis Summary Exercises
Chapter 4 Linear Structures¶
- 4.1. Chapter Introduction: Lists
- 4.2. The List ADT
- 4.3. Array-Based List Implementation
- 4.4. Linked Lists
- 4.5. Comparison of List Implementations
- 4.6. Doubly Linked Lists
- 4.7. List Element Implementations
- 4.8. Stacks
- 4.9. Linked Stacks
- 4.10. Freelists
- 4.11. Implementing Recursion
- 4.12. Queues
- 4.13. Linked Queues
- 4.14. Linear Structure Summary Exercises
Chapter 5 Design¶
Chapter 6 Binary Trees¶
- 6.1. Binary Trees Chapter Introduction
- 6.2. Binary Trees
- 6.3. Binary Tree as a Recursive Data Structure
- 6.4. The Full Binary Tree Theorem
- 6.5. Binary Tree Traversals
- 6.6. Implementing Tree Traversals
- 6.7. Information Flow in Recursive Functions
- 6.8. Binary Tree Node Implementations
- 6.9. Composite-based Expression Tree
- 6.10. Binary Tree Space Requirements
- 6.11. Binary Search Trees
- 6.12. Dictionary Implementation Using a BST
- 6.13. Binary Tree Guided Information Flow
- 6.14. Multiple Binary Trees
- 6.15. A Hard Information Flow Problem
- 6.16. Array Implementation for Complete Binary Trees
- 6.17. Heaps and Priority Queues
- 6.18. Huffman Coding Trees
- 6.19. Trees versus Tries
- 6.20. Proof of Optimality for Huffman Coding
- 6.21. Binary Tree Chapter Summary
