Preface¶
Introduction¶
- 1.1. Data Structures and Algorithms
- 1.2. Abstract Data Types
- 1.3. Basic References Part 1
- 1.4. Basic References Part 2
- 1.5. Pointers Syntax
- 1.6. Local Memory
- 1.7. Heap Memory
Stacks and Queues¶
Runtime Performance¶
Linked Lists¶
Recursion¶
- 6.1. Introduction
- 6.2. Writing a recursive function
- 6.3. Code Completion Practice Exercises
- 6.3.1. Introduction
- 6.3.2. Recursion Programming Exercise: Largest
- 6.3.3. Recursion Programming Exercise: Multiply
- 6.3.4. Recursion Programming Exercise: GCD
- 6.3.5. Recursion Programming Exercise: log
- 6.3.6. Recursion Programming Exercise: Cummulative Sum
- 6.3.7. Recursion Programming Exercise: Add odd values
- 6.3.8. Recursion Programming Exercise: Sum Of the Digits
- 6.3.9. Recursion Programming Exercise: Count Characters
- 6.4. Writing More Sophisticated Recursive Functions
- 6.5. Harder Code Completion Practice Exercises
- 6.6. Writing Practice Exercises
- 6.7. Tracing Recursive Code
- 6.8. Tracing Practice Exercises
- 6.9. Summary Exercises
Hashing¶
Binary Trees¶
- 8.1. Binary Trees Chapter Introduction
- 8.2. Binary Trees
- 8.3. Binary Tree as a Recursive Data Structure
- 8.4. Binary Tree Traversals
- 8.5. Implementing Tree Traversals
- 8.6. Information Flow in Recursive Functions
- 8.6.1. Information Flow in Recursive Functions
- 8.6.2. Binary Tree Set Depth Exercise
- 8.6.3. Collect-and-return
- 8.6.4. Binary Tree Check Sum Exercise
- 8.6.5. Binary Tree Leaf Nodes Count Exercise
- 8.6.6. Binary Tree Sum Nodes Exercise
- 8.6.7. Combining Information Flows
- 8.6.8. Binary Tree Check Value Exercise
- 8.6.9. Combination Problems
- 8.6.10. Binary Tree Height Exercise
- 8.6.11. Binary Tree Get Difference Exercise
- 8.6.12. Binary Tree Has Path Sum Exercise
- 8.7. Binary Tree Node Implementations
