Programming requires a good knowledge of the fundamentals of computer science, especially common data structures and algorithms. This class will cover the heap, a common tree-based data structure popular in interviews. Heaps are a specific derivative of Trees, applying some new properties to the tree to organize data more specifically. Min heaps or max heaps are popular in programming problems.
This class will cover topics including:
- How heaps are stored in computer memory
- Python implementations of heaps, both from scratch and built into the language
- Common operations performed on heaps
- Examples of coding questions that involve heaps
This class is meant for those with some background in a programming language, though Python will be used for examples. Attendees with knowledge of another language should be able to grasp the concepts covered, and some attendees with enough math background but limited or no programming knowledge may be able to understand the class as well, at least on a conceptual level.