Intermediate Level

Basics of Arrays: Declaration, Initialization, and Access

Operations on Arrays: Insertion, Deletion, and Searching

Multi-Dimensional Arrays (2D and 3D Arrays)

Applications: Matrix Operations, Sparse Matrices

Intermediate Level

Singly Linked List

Doubly Linked List

Circular Linked List

Intermediate Level

Introduction to Stack and its Applications

Implementation of Stack using Arrays and Linked Lists

Operations: Push, Pop, Peek

Applications

Intermediate Level

Introduction to Queue and its Applications

Types of Queues

Implementation of Queues using Arrays and Linked Lists

Intermediate Level

Introduction to Recursion

Recursive Algorithms for Factorial, Fibonacci, and Towers of Hanoi

Backtracking with Recursion

Limitations of Recursion

Intermediate Level

Introduction to Trees and Terminology (Root, Leaf, Height, Depth)

Types of Trees

AVL Trees: Rotations (LL, RR, LR, RL)

Heap Trees: Min-Heap and Max-Heap

Tree Applications: Huffman Encoding, Expression Trees

Intermediate Level

Introduction to Graphs and Terminology (Vertices, Edges, Degree)

Representation of Graphs: Adjacency Matrix and List

Graph Traversal Algorithms

Applications of Graphs

Intermediate Level

Hashing Techniques and Hash Functions

Collision Resolution Techniques

Applications of Hashing

Intermediate Level

Searching Algorithms

Sorting Algorithms

Comparison of Sorting Algorithms

Intermediate Level

Tries and Suffix Trees

Disjoint Sets (Union-Find Algorithm)

Segment Trees

Fenwick Trees (Binary Indexed Trees)

Red-Black Trees