Lecture Notes

  1. Introduction
  2. Dynamic Memory Allocation
  3. Recursion
  4. More Recursion
  5. Linked Lists
  6. Algorithm Analysis
  7. More Algorithm Analysis
  8. Stacks
  9. Stack Implementation
  10. Queues
  11. Binary Trees
  12. Binary Trees - Insertion
  13. Binary Trees - Deletion
  14. Expression Trees
  15. AVL Trees - Insertion
  16. AVL Trees - Deletion
  17. Backtracking
  18. Min-Max Trees
  19. N-Squared Sorts
  20. Merge Sort
  21. Quick Sort
  22. Heaps
  23. Hash Tables
  24. Final Exam Review