Data Structures

Day 1 (3 hours)

1. Stacks (1.5 hours)

2. Queues (1.5 hours)

Day 2 (3 hours)

1. Binary Trees (1.5 hours)

2. Binary Search Trees (1.5 hours)

Day 3 (3 hours)

1. Segment Trees (1.5 hours)

2. Fenwick Trees (Binary Indexed Trees) (1.5 hours)

Day 4 (3 hours)

1. Heaps (1.5 hours)

2. Hashing (1.5 hours)

Day 5 (3 hours)

1. Graph Representations (Adjacency Matrix and List) (1.5 hours)

2. Depth-First Search (DFS) (1.5 hours)