Chapter 0 Introduction to Data Structures and Algorithms¶
Chapter 1 Object Oriented Concepts¶
Chapter 2 Algorithm Analysis¶
Chapter 3 Introduction to Pointers in Java¶
- 3.1. Pointers Chapter Introduction
- 3.2. Basic References Part 1
- 3.3. Basic References Part 2
- 3.4. Pointers Syntax
- 3.5. Local Memory
- 3.6. Heap Memory
- 3.7. Link Nodes
- 3.8. Link Nodes Practice Exercises
- 3.9. Pointers Concepts Summary
- 3.10. Additional Practice Exercises
Chapter 4 Linear Structures¶
Chapter 5 Stacks¶
Chapter 6 Queues¶
Chapter 7 Lists¶
Chapter 8 Recursion¶
- 8.1. Introduction
- 8.2. Writing a recursive function
- 8.3. Code Completion Practice Exercises
- 8.3.1. Introduction
- 8.3.2. Recursion Programming Exercise: Largest
- 8.3.3. Recursion Programming Exercise: Multiply
- 8.3.4. Recursion Programming Exercise: GCD
- 8.3.5. Recursion Programming Exercise: log
- 8.3.6. Recursion Programming Exercise: Cummulative Sum
- 8.3.7. Recursion Programming Exercise: Add odd values
- 8.3.8. Recursion Programming Exercise: Sum Of the Digits
- 8.3.9. Recursion Programming Exercise: Count Characters
- 8.4. Writing More Sophisticated Recursive Functions
- 8.5. Harder Code Completion Practice Exercises
- 8.6. Writing Practice Exercises
- 8.7. Tracing Recursive Code
- 8.8. Tracing Practice Exercises
- 8.9. Summary Exercises
Chapter 9 Searching I¶
Chapter 10 Sorting¶
- 10.1. Chapter Introduction: Sorting
- 10.2. Sorting Terminology and Notation
- 10.3. Insertion Sort
- 10.4. Bubble Sort
- 10.5. Selection Sort
- 10.6. The Cost of Exchange Sorting
- 10.7. Quicksort
- 10.8. Mergesort Concepts
- 10.9. Implementing Mergesort
- 10.10. Radix Sort
- 10.11. Heapsort
- 10.12. An Empirical Comparison of Sorting Algorithms
- 10.13. Sorting Summary Exercises
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. Binary Tree Traversals
- 11.5. Implementing Tree Traversals
- 11.6. Binary Tree Node Implementations
- 11.7. Composite-based Expression Tree
- 11.8. Binary Search Trees
- 11.9. Array Implementation for Complete Binary Trees
- 11.10. Binary Tree Chapter Summary
