Chapter 0 Preface¶
Chapter 1 Introduction for Data Structures and Algorithms Courses¶
Chapter 2 Algorithm Analysis¶
Chapter 3 Introduction to Pointers in Java¶
Chapter 4 Stacks¶
Chapter 5 Recursion¶
- 5.1. Introduction
- 5.2. Writing a recursive function
- 5.3. Code Completion Practice Exercises
- 5.3.1. Introduction
- 5.3.2. Recursion Programming Exercise: Largest
- 5.3.3. Recursion Programming Exercise: Multiply
- 5.3.4. Recursion Programming Exercise: GCD
- 5.3.5. Recursion Programming Exercise: log
- 5.3.6. Recursion Programming Exercise: Cummulative Sum
- 5.3.7. Recursion Programming Exercise: Add odd positions
- 5.3.8. Recursion Programming Exercise: Sum Of the Digits
- 5.3.9. Recursion Programming Exercise: Count Characters
- 5.4. Writing More Sophisticated Recursive Functions
- 5.5. Harder Code Completion Practice Exercises
- 5.6. Writing Practice Exercises
- 5.7. Tracing Recursive Code
- 5.8. Tracing Practice Exercises
- 5.9. Summary Exercises
Chapter 6 Sorting¶
Chapter 7 Queues¶
Chapter 8 Linked Lists¶
Chapter 9 Binary Trees¶
- 9.1. Binary Trees Chapter Introduction
- 9.2. Binary Trees
- 9.3. Binary Tree as a Recursive Data Structure
- 9.4. The Full Binary Tree Theorem
- 9.5. Binary Tree Traversals
- 9.6. Implementing Tree Traversals
- 9.7. Information Flow in Recursive Functions
- 9.7.1. Information Flow in Recursive Functions
- 9.7.2. Binary Tree Set Depth Exercise
- 9.7.3. Collect-and-return
- 9.7.4. Binary Tree Check Sum Exercise
- 9.7.5. Binary Tree Leaf Nodes Count Exercise
- 9.7.6. Binary Tree Sum Nodes Exercise
- 9.7.7. Combining Information Flows
- 9.7.8. Binary Tree Check Value Exercise
- 9.7.9. Combination Problems
- 9.7.10. Binary Tree Height Exercise
- 9.7.11. Binary Tree Get Difference Exercise
- 9.7.12. Binary Tree Has Path Sum Exercise
- 9.8. Binary Tree Node Implementations
- 9.9. Composite-based Expression Tree
- 9.10. Binary Tree Space Requirements
- 9.11. Binary Search Trees
- 9.12. Dictionary Implementation Using a BST
- 9.13. Binary Tree Guided Information Flow
- 9.14. Multiple Binary Trees
- 9.15. A Hard Information Flow Problem
- 9.16. Array Implementation for Complete Binary Trees
- 9.17. Heaps and Priority Queues
- 9.18. Huffman Coding Trees
- 9.19. Trees versus Tries
- 9.20. Proof of Optimality for Huffman Coding
- 9.21. Binary Tree Chapter Summary
