Skip to content
Sabaqاردو

Data Structures Complete Course (Gate Smashers)

By Gate Smashers

Course audio
Course audio: Hindi
Level
Intermediate
Length
66 lessons · 11.3 hours

What you'll be able to do

  • Calculate addresses in 1D, 2D and 3D arrays
  • Use two-pointer and sliding-window techniques
  • Implement linked lists, stacks and queues and convert infix expressions
  • Build BST, AVL and red-black trees and traverse them

About this course

Gate Smashers' data structures course in Hindi, 66 lectures and about 11 hours, built for university exams, GATE and placements. It starts with a DSA roadmap, arrays and address calculation for 1D, 2D, 3D and triangular arrays, then problem-solving techniques such as two pointers, sliding window and maximum subarray sum, and linear and binary search. It covers singly linked list operations and cycle detection, stacks with arrays and linked lists, recursion, infix, prefix and postfix conversion and evaluation with practice questions, and queues. Trees follow: binary search trees, traversals, AVL rotations, red-black tree insertion and complexities, and finally graph cycle detection. Clear whiteboard teaching suits BS students in Pakistan.

Before you start: Basic C or C++ programming.

Syllabus

66 lessons · 11:17:45 in total

  1. 1Lec-1: Roadmap 🛣️ of DSA | Syllabus of Data structure | Data Structure for Beginners10:20
  2. 2Lec-2: Introduction to Data Structure with real life examples by #Naina Mam5:21
  3. 3Lec-3: Arrays in Data Structure by #Naina Mam | Initialization, Declaration, Memory Representation11:07
  4. 4Lec-4: Types of Array | One dimensional & Multi-dimensional Array by #Naina Mam9:17
  5. 5Lec-5: Addressing in One Dimensional Array by #Naina Mam | Data Structure7:32
  6. 6Lec-6: 2D Arrays | Addressing in 2D Arrays | Row Major Order8:21
  7. 7Lec-7: 3D Arrays | Addressing in 3D Arrays | Row Major Order12:08
  8. 8Lec-8: Addressing in Lower Triangular Matrix | Data Structure for beginners10:48
  9. 9Lec-9: Find 2nd Largest2️⃣ Number in Array | Data Structure for beginners9:00
  10. 10Lec-10: Two 2️⃣ Pointer👆 Technique | Two 2️⃣ Sum Problem in Data Structure10:33
  11. 11Lec-11: Maximum Sum Subarray Problem | Understand Naive Approach16:20
  12. 12Lec-12: Sliding Window 🪟 Technique | Data Structure13:10
  13. 13Lec-13: Remove Duplicate Elements in Sorted Array | Various Methods | Data Structure9:05
  14. 14Lec-14: Linear Search in Data Structure by #Naina Mam | Time Complexity12:28
  15. 15Lec-15: Binary Search in Data Structure by #Naina Mam10:33
  16. 16Lec-16: Introduction to Linked List | Types and Need of linked list | data structures10:17
  17. 17Lec-17: Arrays vs Linked Lists | Data Structures8:41
  18. 18Lec-18: Single Linked List in Data Structures | Self Referential Structure8:27
  19. 19Lec-19: The Basic Operations of Linked List | Data Structure8:28
  20. 20Lec-20: Traversing in Linked list | Data Structure12:38
  21. 21Lec-21: Insert a node at the beginning of Linked list | Data Structure10:44
  22. 22Lec-22: Insert a node at the end of Linked List | Data Structure14:45
  23. 23Lec-23: Insert a node after a given node in Linked List | Data Structure13:39
  24. 24Lec-24: Delete a node from the beginning of Linked List | Data Structure6:05
  25. 25Lec-25: Delete a node from the end of Linked List | Data Structure12:53
  26. 26Lec-26: Deletion after a given node in Linked List | Data Structure9:46
  27. 27Lec-27: Deleting Entire Linked List🔗| Single Linked List🔗| Data Structure10:23
  28. 28Lec-28: Introduction to Doubly Linked List | Data Structure9:57
  29. 29Lec-29: How to find a Cycle in Linked List | 2 Pointer Algorithm | DS for Beginners6:43
  30. 30Lec-30: Introduction to Stack | PUSH and POP operations | Data Structure6:46
Show all 66 lessons
  1. 31Lec-31: PUSH operation using Array | Implementation of Stack | Data Structure8:05
  2. 32Lec-32: POP operation using Array | Implementation of Stack | Data Structure7:32
  3. 33Lec-33: PUSH operation using Linked List | Implementation of Stack | Data Structure14:29
  4. 34Lec-34: POP operation using Linked List | Implementation of Stack | Data Structure6:44
  5. 35Lec-35: Recursion vs Loop | How both approaches work | Data structure for interview preparation6:25
  6. 36Lec-36: Infix, Prefix & Postfix👩‍🔧 with examples | Data Structure13:33
  7. 37Lec-37: Infix to prefix Conversion | Infix➡️Prefix Conversion with examples | Data Structure7:26
  8. 38Lec-38: Infix to Postfix Conversion | Infix➡️Postfix Conversion with examples | Data Structure12:21
  9. 39Lec-39: Infix to Prefix conversion using Stack | Data Structure9:19
  10. 40Lec-40: Infix to postfix Conversion using Stack | Infix➡️Postfix Conversion with examples15:15
  11. 41Lec-41: Practice question on Infix to postfix notation | Data Structure7:17
  12. 42Lec-42: Postfix Expression Evaluation | Stack Application | Data Structure10:52
  13. 43Lec-43: Practice question on Postfix Evaluation | Stack | Data Structure6:16
  14. 44Lec-44: Understanding Call Stack with example | Data Structure #gatesmashers #Stack8:52
  15. 45Lec-45: The Magic of Recursion: Understanding the Power of Recursive Functions | Time Complexity13:54
  16. 46Lec-46: Introduction to Queue Data structure with real life example | Data Structure #queue9:05
  17. 47Lec-47: Enqueue(), Dequeue() & other Operations on Queue | Data Structure9:32
  18. 48Lec-48: Dequeue() in Queue using Array | Data Structure #gatesmashers12:13
  19. 49Lec-49: isfull() and isempty() in queue | Queue operations | Data Structure7:27
  20. 50Lec-50: Implementation of Queue using Array | Enqueue() in Queue | Data Structure #gatesmashers13:15
  21. 51Lec-51: Implementation of Queue using Linked List | Enqueue() in Queue | Data Structure11:35
  22. 52Lec-52: Introduction to Trees | Binary Tree, Almost Complete Binary Tree, Full BT, Complete10:46
  23. 53Lec-53: Binary Search Tree in Data Structure | Insertion and Traversal in BST11:02
  24. 54Lec-54: Deletion from Binary Search Tree(BST) with Example | Data Structure8:36
  25. 55Lec-55: Find Preorder, Postorder & Inorder of Binary Search Tree(BST) in Data Structure9:39
  26. 56Lec-56: Preorder, Inorder and Postorder in 5 minute | Tree Traversal | Easiest and Shortest Trick6:47
  27. 57Lec-57: Imp Question on Binary Search Tree | GATE Question | Data Structure11:21
  28. 58Lec-58: Introduction to AVL Tree in Data Structure with Examples | All Imp Points of AVL9:54
  29. 59Lec-59: How to Create AVL tree | LL, RR, LR, RL Rotation in AVL | Data Structure10:46
  30. 60Lec-60: AVL Tree Creation in Data Structure | All Imp Points12:53
  31. 61Lec-61: Time Complexities of All Trees | Binary Tree, Binary Search Tree, AVL Tree, Heap Tree11:47
  32. 62Lec-62: Introduction to Red-Black Tree | Data Structure for Beginners9:13
  33. 63Lec-63: Insertion in Red Black Tree | Data Structure for Beginners22:52
  34. 64Lec-64: Topological Order/ Sort in DAG(Direct Acyclic Graph)6:44
  35. 65LEC-65 : How to Find Cycle in Undirected Graph using DFS8:13
  36. 66LEC-66 : How to Find Cycle in Directed Graph using DFS9:30

What to take next

Related courses

Videos by Gate Smashers, played from their official YouTube channel. Subscribe on YouTube

Official upload by the teacher or institution on their own channel, shown with YouTube's embedded player.

Lessons listed from the official YouTube playlist. Full playlist on YouTube

Lessons last checked Oct 2026. Course summary and lesson structure by Sabaq.

Report a problem or a rights request