Preface¶
Introduction for Data Structures and Algorithms Courses¶
Object Oriented Programming¶
List Interface & Array based Lists¶
Searching¶
Algorithm Analysis¶
Linked Lists¶
Queues¶
Stacks¶
Hashing¶
Recursion¶
- 10.1. Introduction
- 10.2. Writing a recursive function
- 10.3. Code Completion Practice Exercises
- 10.3.1. Introduction
- 10.3.2. Recursion Programming Exercise: Largest
- 10.3.3. Recursion Programming Exercise: Multiply
- 10.3.4. Recursion Programming Exercise: GCD
- 10.3.5. Recursion Programming Exercise: log
- 10.3.6. Recursion Programming Exercise: Cummulative Sum
- 10.3.7. Recursion Programming Exercise: Add odd values
- 10.3.8. Recursion Programming Exercise: Sum Of the Digits
- 10.3.9. Recursion Programming Exercise: Count Characters
- 10.4. Writing More Sophisticated Recursive Functions
- 10.5. Harder Code Completion Practice Exercises
- 10.6. Writing Practice Exercises
- 10.7. Tracing Recursive Code
- 10.8. Tracing Practice Exercises
- 10.9. Summary Exercises
Binary Trees¶
- 11.1. Binary Trees Chapter Introduction
- 11.2. Binary Trees
- 11.3. Binary Tree as a Recursive Data Structure
- 11.4. The Full Binary Tree Theorem
- 11.5. Binary Tree Traversals
- 11.6. Implementing Tree Traversals
- 11.7. Information Flow in Recursive Functions
- 11.7.1. Information Flow in Recursive Functions
- 11.7.2. Binary Tree Set Depth Exercise
- 11.7.3. Collect-and-return
- 11.7.4. Binary Tree Check Sum Exercise
- 11.7.5. Binary Tree Leaf Nodes Count Exercise
- 11.7.6. Binary Tree Sum Nodes Exercise
- 11.7.7. Combining Information Flows
- 11.7.8. Binary Tree Check Value Exercise
- 11.7.9. Combination Problems
- 11.7.10. Binary Tree Height Exercise
- 11.7.11. Binary Tree Get Difference Exercise
- 11.7.12. Binary Tree Has Path Sum Exercise
- 11.8. Binary Tree Node Implementations
- 11.9. Composite-based Expression Tree
- 11.10. Binary Tree Space Requirements
- 11.11. Binary Search Trees
- 11.12. Dictionary Implementation Using a BST
- 11.13. Binary Tree Guided Information Flow
- 11.14. Multiple Binary Trees
- 11.15. A Hard Information Flow Problem
- 11.16. Array Implementation for Complete Binary Trees
- 11.17. Heaps and Priority Queues
- 11.18. Huffman Coding Trees
- 11.19. Trees versus Tries
- 11.20. Proof of Optimality for Huffman Coding
- 11.21. Binary Tree Chapter Summary
Sorting¶
- 12.1. Chapter Introduction: Sorting
- 12.2. Sorting Terminology and Notation
- 12.3. Comparing Records
- 12.4. An Empirical Comparison of Sorting Algorithms
- 12.5. Binsort
- 12.6. Radix Sort
- 12.7. Insertion Sort
- 12.8. Bubble Sort
- 12.9. Selection Sort
- 12.10. Mergesort Concepts
- 12.11. Sorting Summary Exercises
