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¶
- -1.1. Introduction to Recursion
- -1.2. Writing a recursive function
- -1.3. Code Completion Practice Exercises
- -1.3.1. Introduction
- -1.3.2. Recursion Programming Exercise: Largest
- -1.3.3. Recursion Programming Exercise: Multiply
- -1.3.4. Recursion Programming Exercise: GCD
- -1.3.5. Recursion Programming Exercise: log
- -1.3.6. Recursion Programming Exercise: Cummulative Sum
- -1.3.7. Recursion Programming Exercise: Add odd values
- -1.3.8. Recursion Programming Exercise: Sum Of the Digits
- -1.3.9. Recursion Programming Exercise: Count Characters
- -1.4. Writing More Sophisticated Recursive Functions
- -1.5. Intermediate Recursion Code Completion Exercises
- -1.6. Writing Practice Exercises
- -1.7. Tracing Recursive Code
- -1.8. Recursion Code Tracing Practice Exercises
- -1.9. Recursion Summary Questions
Binary Trees¶
- -1.1. Binary Trees Chapter Introduction
- -1.2. Binary Trees
- -1.3. Binary Tree as a Recursive Data Structure
- -1.4. The Full Binary Tree Theorem
- -1.5. Binary Tree Traversals
- -1.6. Implementing Tree Traversals
- -1.7. Information Flow in Recursive Functions
- -1.7.1. Information Flow in Recursive Functions
- -1.7.2. Binary Tree Set Depth Exercise
- -1.7.3. Collect-and-return
- -1.7.4. Binary Tree Check Sum Exercise
- -1.7.5. Binary Tree Leaf Nodes Count Exercise
- -1.7.6. Binary Tree Sum Nodes Exercise
- -1.7.7. Combining Information Flows
- -1.7.8. Binary Tree Check Value Exercise
- -1.7.9. Combination Problems
- -1.7.10. Binary Tree Height Exercise
- -1.7.11. Binary Tree Get Difference Exercise
- -1.7.12. Binary Tree Has Path Sum Exercise
- -1.8. Binary Tree Node Implementations
- -1.9. Composite-based Expression Tree
- -1.10. Binary Tree Space Requirements
- -1.11. Binary Search Trees
- -1.12. Dictionary Implementation Using a BST
- -1.13. Binary Tree Guided Information Flow
- -1.14. Multiple Binary Trees
- -1.15. A Hard Information Flow Problem
- -1.16. Array Implementation for Complete Binary Trees
- -1.17. Heaps and Priority Queues
- -1.18. Huffman Coding Trees
- -1.19. Trees versus Tries
- -1.20. Proof of Optimality for Huffman Coding
- -1.21. Binary Tree Chapter Summary
Sorting¶
- -1.1. Chapter Introduction: Sorting
- -1.2. Sorting Terminology and Notation
- -1.3. Comparing Records
- -1.4. An Empirical Comparison of Sorting Algorithms
- -1.5. Binsort
- -1.6. Radix Sort
- -1.7. Insertion Sort
- -1.8. Bubble Sort
- -1.9. Selection Sort
- -1.10. Mergesort Concepts
- -1.11. Sorting Summary Exercises
