Chapter 0 Preface¶
Chapter 1 Introduction for Data Structures and Algorithms Courses¶
Chapter 2 Object-Oriented Programming¶
Chapter 3 List Interface & Array-based Lists¶
Chapter 4 Algorithm Analysis¶
Chapter 5 Introduction to Pointers in Java¶
- 5.1. Pointers Chapter Introduction
- 5.2. Basic References
- 5.2.1. Pointers and References
- 5.2.2. Shallow and Deep Copying
- 5.2.2.1. Bad References
- 5.2.2.2. Why Are Bad Reference Bugs So Common?
- 5.2.2.3. Syntax
- 5.2.2.4. Declaring a Reference Variable
- 5.2.2.5. Assigning a pointee to a reference
- 5.2.2.6. Dereference the reference
- 5.2.2.7. Example Reference Code
- 5.2.2.8. Reference Rules Summary
- 5.2.2.9. Java References vs Pointers
- 5.2.2.10. How Are References Implemented In The Machine?
- 5.3. Local Memory
- 5.4. Heap Memory
- 5.5. Link Nodes
Chapter 6 Stacks¶
Chapter 7 Recursion¶
- 7.1. Introduction
- 7.2. Writing a recursive function
- 7.3. Code Completion Practice Exercises
- 7.3.1. Introduction
- 7.3.2. Recursion Programming Exercise: Largest
- 7.3.3. Recursion Programming Exercise: Multiply
- 7.3.4. Recursion Programming Exercise: GCD
- 7.3.5. Recursion Programming Exercise: log
- 7.3.6. Recursion Programming Exercise: Cummulative Sum
- 7.3.7. Recursion Programming Exercise: Add odd positions
- 7.3.8. Recursion Programming Exercise: Sum Of the Digits
- 7.3.9. Recursion Programming Exercise: Count Characters
- 7.4. Writing More Sophisticated Recursive Functions
- 7.5. Harder Code Completion Practice Exercises
- 7.6. Writing Practice Exercises
- 7.7. Tracing Recursive Code
- 7.8. Tracing Practice Exercises
- 7.9. Summary Exercises
Chapter 8 Sorting¶
Chapter 9 Queues¶
Chapter 10 Linked Lists¶
Chapter 11 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
