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.