This summer camp series will emulate the beginning of college-level data structures courses. After a short review of Java syntax and object-oriented programming, we will dive into learning about and then writing our own versions of various data structures. We'll talk a lot about time complexity (Big-O), space complexity, and practical applications for certain data structures. Starting with arrays (both static and dynamic), we'll move on linked lists, stacks/queues, and trees (binary search trees, red-black trees, etc.). We will also talk briefly about heaps, sorting/searching algorithms, and graphs.

This series will help you master the full unit of [Trigonometry](https://www.khanacademy.org/math/algebra2/x2ec2f6f830c9fb89:trig) in Khan Academy's Algebra 2 course! You will go through Khan Academy skills, culminating with you taking the final Unit Test.

Have you ever wondered what to explore after completing a year of computer science? We'll cover a variety of data structures, from arrays to linked lists to heaps and adjacency lists, while implementing them ourselves and discussing their time and space complexities. Alongside these data structures, we'll discuss relevant algorithms (for example, heap sort for heaps), that you can explore and use in your own software. This series, will be taught in Java, but these concepts can be applied to most languages. It is expected everyone is familiar with the basics of object-oriented programming (having taken AP Computer Science A is preferred).

We'll learn about Big-O notation and a variety of data structures in Java. The series will be centered around making time efficient structures. --- NEW SESSIONS WILL BE ADDED THROUGHOUT THE SERIES --- Please note, you should have knowledge of syntax in Java and know what things like arrays are.

We'll work through each topic covered in AP Computer Science A to ensure you get a high score on the AP exam! Throughout the series, we will practice with real AP multiple-choice and free-response questions. **New sessions will be added, times TBD**