Chapter 0 Preface¶
Chapter 1 Introduction¶
Chapter 2 Recursion¶
- 2.1. Introduction
- 2.2. Writing a recursive function
- 2.3. Code Completion Practice Exercises
- 2.3.1. Introduction
- 2.3.2. Recursion Programming Exercise: Largest
- 2.3.3. Recursion Programming Exercise: Multiply
- 2.3.4. Recursion Programming Exercise: GCD
- 2.3.5. Recursion Programming Exercise: log
- 2.3.6. Recursion Programming Exercise: Cummulative Sum
- 2.3.7. Recursion Programming Exercise: Add odd positions
- 2.3.8. Recursion Programming Exercise: Sum Of the Digits
- 2.3.9. Recursion Programming Exercise: Count Characters
- 2.4. Writing More Sophisticated Recursive Functions
- 2.5. Harder Code Completion Practice Exercises
- 2.6. Writing Practice Exercises
- 2.7. Tracing Recursive Code
- 2.8. Tracing Practice Exercises
- 2.9. Summary Exercises
Chapter 3 Algorithm Analysis¶
Chapter 4 Linked Lists¶
Chapter 5 Stacks¶
Chapter 6 Queues¶
Chapter 7 Binary Trees¶
- 7.1. Binary Trees Chapter Introduction
- 7.2. Binary Trees
- 7.3. The Full Binary Tree Theorem
- 7.4. Binary Tree Traversals
- 7.5. Implementing Tree Traversals
- 7.6. Information Flow in Recursive Functions
- 7.6.1. Information Flow in Recursive Functions
- 7.6.2. Binary Tree Set Depth Exercise
- 7.6.3. Collect-and-return
- 7.6.4. Binary Tree Check Sum Exercise
- 7.6.5. Binary Tree Leaf Nodes Count Exercise
- 7.6.6. Binary Tree Sum Nodes Exercise
- 7.6.7. Combining Information Flows
- 7.6.8. Binary Tree Check Value Exercise
- 7.6.9. Combination Problems
- 7.6.10. Binary Tree Height Exercise
- 7.6.11. Binary Tree Get Difference Exercise
- 7.6.12. Binary Tree Has Path Sum Exercise
- 7.7. Binary Tree Node Implementations
- 7.8. Binary Search Trees
- 7.9. Binary Tree Guided Information Flow
- 7.10. Multiple Binary Trees
- 7.11. A Hard Information Flow Problem
- 7.12. Array Implementation for Complete Binary Trees
- 7.13. Heaps and Priority Queues
- 7.14. Huffman Coding Trees
- 7.15. Trees versus Tries
- 7.16. Proof of Optimality for Huffman Coding
- 7.17. Binary Tree Chapter Summary
