Welcome to the first week of discussion! We're doing a quick overview of C++. Get ready to brush up on pointers, data types, classes, and more!

This week, we're diving into the world of algorithmic analysis and pseudocode. Get ready to learn how to analyze the efficiency of algorithms and write pseudocode to plan out your code.

This week, we review stacks and queues as well as common algorithmic strategies such as the slow pointer, fast pointer technique on Linked Lists.

This week, we review binary trees and the different tree traversals. We'll also cover a special case called binary search trees.

This week, we go over balanced trees and their advantages over binary search trees. We'll mainly focus on AVL trees and touch on red-black, splay, B, and B+ trees.

This week, we dive into a mock interview to prepare you for the job market! We'll go over resumes, behavioral questions, and technical questions.

Exam 1 Review!!! Review trees, BSTs, and heaps in preparation for the midterm.

This week we discuss sorting algorithms! We'll go over the basic quadratic sorts, then the more advanced linearithmic sorts, and some niche sorts such as shell sort.