Data Structures I 📚

Agenda

1. What is Stack Memory?
2. What is Heap Memory?
3. Stack vs. Heap
4. Intro to Pointers
5. What are Dangling Pointers?
6. Intro to Struct
7. Intro to Classes
8. What is Overloading?
9. Dynamic Arrays
10. Templates
11. Vector Implementation
12. Linked List Implementation

1. What is Stack Memory? 🧠

• The stack is a reserved region of memory that is automatically allocated by the program at runtime.
• It follows the LIFO (Last-In, First-Out) principle.
• Stores variables and function call frames.
• When a function completes, its call frame is removed, and memory is freed.