Introduction & Memory Foundations
Pointers and Dynamic Memory Allocation (malloc, calloc, realloc, free)
Structures (struct) and Self-Referential Structures
Type Definitions (typedef) and Unions
Linear Data Structures
Arrays (Single and Multi-dimensional)
Singly Linked Lists, Doubly Linked Lists,
and Circular Linked ListsStacks (Array and Linked List implementations)
Queues (Linear, Circular, Priority Queues, and Deques)
Non-Linear Data Structures
Binary Trees, Binary Search Trees (BST), and AVL Trees
Heaps (Max-Heap and Min-Heap)
Graphs (Adjacency Matrix and Adjacency List representations)
Hashing & Advanced Concepts
Hash Tables and Collision Resolution Techniques
Tries and Suffix Trees
Algorithmic Operations on Structures
Searching Algorithms (Linear and Binary Search)
Sorting Algorithms (Bubble, Insertion, Selection, Merge, and Quick Sort)
Graph Traversals (Breadth-First Search and Depth-First Search)