Sharan P

We will be going over three main data structures that are essential in many algorithms: - Stacks (Recursion-based) - Queues (Useful in BFS) - Binary Search Trees (Fast search algorithms) This session does not involve any programming, so no programming experience is required, and we will be learning these algorithms from scratch, so don't worry if you haven't heard of these data structures before!

In just one hour, get ready to learn all about recursive functions, also known as piecewise functions! By the end of the session, you will have all the fundamental knowledge necessary to solve recursion-related problems! Pre-requisite: Please be comfortable with equations, variables, and the basics of functions. It is totally alright if you are not very familiar with functions, feel free to ask any additional questions during class. Additionally, you can check out the functions chapter from Khan Academy's Algebra 1 course.