| Parent directory/ | - | - |
| 04 ---- PART 1 ------ BUILT IN DATA STRUCTURES/ | - | 2026-Feb-12 13:35 |
| 03 Lets Dive In/ | - | 2026-Feb-12 13:35 |
| 02 DO NOT SKIP THIS/ | - | 2026-Feb-12 13:35 |
| 01 Introduction to the course/ | - | 2026-Feb-12 13:35 |
| 05 Lists as Data Structure/ | - | 2026-Feb-12 13:35 |
| 06 Tuple as Data Structure/ | - | 2026-Feb-12 13:35 |
| 07 Sets as Data Structure/ | - | 2026-Feb-12 13:35 |
| 08 Dictionaries as Data Structure/ | - | 2026-Feb-12 13:35 |
| 09 2-D Arrays/ | - | 2026-Feb-12 13:35 |
| 10 --------------PART 2----OOPS---------------------/ | - | 2026-Feb-12 13:35 |
| 12 --------------PART 3--------------USER DEFINED DATA STRUCTURES/ | - | 2026-Feb-12 13:35 |
| 11 Time Complexity/ | - | 2026-Feb-12 13:35 |
| 13 Stacks/ | - | 2026-Feb-12 13:35 |
| 15 Linked Lists/ | - | 2026-Feb-12 13:35 |
| 14 Queues/ | - | 2026-Feb-12 13:35 |
| 16 Doubly Linked Lists/ | - | 2026-Feb-12 13:34 |
| 17 Circular Linked Lists/ | - | 2026-Feb-12 13:34 |
| 18 Deque/ | - | 2026-Feb-12 13:34 |
| 19 Trees/ | - | 2026-Feb-12 13:34 |
| 20 Binary Trees/ | - | 2026-Feb-12 13:34 |
| 21 Binary Search Trees/ | - | 2026-Feb-12 13:34 |
| 22 Tree Traversals/ | - | 2026-Feb-12 13:34 |
| 23 AVL Trees/ | - | 2026-Feb-12 13:34 |
| 24 Heaps/ | - | 2026-Feb-12 13:34 |
| 25 Heap Sort/ | - | 2026-Feb-12 13:34 |
| 26 Priority Queue/ | - | 2026-Feb-12 13:34 |
| 27 HashMaps/ | - | 2026-Feb-12 13:34 |
| 28 Graphs/ | - | 2026-Feb-12 13:34 |
| 29 Graph Traversals/ | - | 2026-Feb-12 13:34 |
| 30 Spanning Trees/ | - | 2026-Feb-12 13:34 |
| 31 Algorithms To Find MST (Optional)/ | - | 2026-Feb-12 13:33 |
| 32 Tries/ | - | 2026-Feb-12 13:33 |
| 35 Thank You Note/ | - | 2026-Feb-12 13:33 |
| 34 Take Away/ | - | 2026-Feb-12 13:33 |
| 33 NOTE/ | - | 2026-Feb-12 13:33 |