Chapter 0 Introduction for Data Structures and Algorithms Courses¶
Chapter 1 Abstract Data Types¶
Chapter 2 Binary Trees¶
- 2.1. Binary Trees Chapter Introduction
- 2.2. Binary Trees
- 2.3. Binary Tree as a Recursive Data Structure
- 2.4. Binary Tree Traversals
- 2.5. Implementing Tree Traversals
- 2.6. Information Flow in Recursive Functions
- 2.6.1. Information Flow in Recursive Functions
- 2.6.2. Binary Tree Set Depth Exercise
- 2.6.3. Collect-and-return
- 2.6.4. Binary Tree Check Sum Exercise
- 2.6.5. Binary Tree Leaf Nodes Count Exercise
- 2.6.6. Binary Tree Sum Nodes Exercise
- 2.6.7. Combining Information Flows
- 2.6.8. Binary Tree Check Value Exercise
- 2.6.9. Combination Problems
- 2.6.10. Binary Tree Height Exercise
- 2.6.11. Binary Tree Get Difference Exercise
- 2.6.12. Binary Tree Has Path Sum Exercise
Chapter 3 Graphs¶
Chapter 4 Searching¶
Chapter 5 Mathematical Background¶
Chapter 6 Algorithm Analysis¶
- 6.1. Chapter Introduction
- 6.2. Problems, Algorithms, and Programs
- 6.3. Comparing Algorithms
- 6.4. Best, Worst, and Average Cases
- 6.5. Faster Computer, or Faster Algorithm?
- 6.6. Asymptotic Analysis and Upper Bounds
- 6.7. Lower Bounds and \(\Theta\) Notation
- 6.8. Calculating Program Running Time
- 6.9. Analyzing Problems
- 6.10. Common Misunderstandings
- 6.11. Multiple Parameters
- 6.12. Space Bounds
- 6.13. Code Tuning and Empirical Analysis
- 6.14. Algorithm Analysis Summary Exercises
- 6.15. Algorithm Analysis Summary Exercises
Chapter 7 Priority Queues¶
Chapter 8 Sorting¶
- 8.1. Chapter Introduction: Sorting
- 8.2. Sorting Terminology and Notation
- 8.3. Insertion Sort
- 8.4. Bubble Sort
- 8.5. Selection Sort
- 8.6. The Cost of Exchange Sorting
- 8.7. Optimizing Sort Algorithms with Code Tuning
- 8.8. Shellsort
- 8.9. Mergesort Concepts
- 8.10. Implementing Mergesort
- 8.11. Quicksort
- 8.12. Heapsort
- 8.13. Binsort
- 8.14. Radix Sort
- 8.15. An Empirical Comparison of Sorting Algorithms
- 8.16. Lower Bounds for Sorting
- 8.17. Sorting Summary Exercises
