Chapter 0 Preface¶
Chapter 1 Object-oriented Programming Tutorials¶
- 1.1. Introduction to Object Oriented Programming
- 1.2. The Unified Modeling Language
- 1.3. Command Line Basics
- 1.4. Parsing Command Line Parameters In Your Progam
- 1.5. Using Parameters in Eclipse
- 1.6. Installing the Web-CAT Submission Plug-in for Eclipse
- 1.7. Common Debugging Methods
- 1.8. Debugging In Eclipse
- 1.9. JUnit Testing And You
- 1.10. Writing JUnit Tests
- 1.11. Code Coverage In JUnit
- 1.12. Testing
- 1.13. Testing for Code Coverage
- 1.14. Another Example
- 1.15. Bowling Example
Chapter 2 Introduction for Data Structures and Algorithms Courses¶
Chapter 3 Algorithm Analysis¶
Chapter 4 Linked Nodes and Linked Lists¶
- 4.1. Pointers Chapter Introduction
- 4.2. Pointers Syntax
- 4.3. Link Nodes
- 4.4. Link Nodes Practice Exercises
- 4.5. Pointers Concepts Summary
- 4.6. Additional Practice Exercises
- 4.7. More Practice Exercises
- 4.7.1. AddNodeAfterRef7
- 4.7.2. ChangeHeadNodeValue
- 4.7.3. ConcatenateTwoLists
- 4.7.4. DeleteNode
- 4.7.5. FirstNodeEqualsValue
- 4.7.6. InsertListAfterRef13
- 4.7.7. InsertListInMiddle
- 4.7.8. LastNodeParam5
- 4.7.9. LastNodeRef1
- 4.7.10. LoopInChain15
- 4.7.11. MiddleNodeRef3
- 4.7.12. ReferenceSecondLastNode
- 4.7.13. ReferenceValueNode
- 4.7.14. RemoveRefNext9
- 4.7.15. ReverseUpToRef11
- 4.8. Linked Lists
- 4.9. Comparison of List Implementations
- 4.10. Doubly Linked Lists
- 4.11. List Element Implementations
- 4.12. Freelists
- 4.13. Linear Structure Summary Exercises
Chapter 5 Stacks¶
Chapter 6 Queues¶
Chapter 7 Searching and Sorting¶
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 Binary Trees¶
- 9.1. Binary Trees Chapter Introduction
- 9.2. Binary Trees
- 9.3. Binary Tree as a Recursive Data Structure
- 9.4. Binary Tree Traversals
- 9.5. Implementing Tree Traversals
- 9.6. Information Flow in Recursive Functions
- 9.6.1. Information Flow in Recursive Functions
- 9.6.2. Binary Tree Set Depth Exercise
- 9.6.3. Collect-and-return
- 9.6.4. Binary Tree Check Sum Exercise
- 9.6.5. Binary Tree Leaf Nodes Count Exercise
- 9.6.6. Binary Tree Sum Nodes Exercise
- 9.6.7. Combining Information Flows
- 9.6.8. Binary Tree Check Value Exercise
- 9.6.9. Combination Problems
- 9.6.10. Binary Tree Height Exercise
- 9.6.11. Binary Tree Get Difference Exercise
- 9.6.12. Binary Tree Has Path Sum Exercise
- 9.7. Binary Tree Node Implementations
- 9.8. Composite-based Expression Tree
- 9.9. Binary Tree Space Requirements
- 9.10. Binary Search Trees
