Data Structure (Hindi)

   Saturday, April 25, 2026   

Starting a new Lecture Notes Series on Data Structure

Youtube Lecture Playlist Credits 

Channel Name: Gate Smashers

So Let Us Start to This Journey of Learning 

Data Structure By Lecture Notes together!

Lecture 1: Lec-1: Roadmap 🛣️ of DSA | Syllabus of Data structure | Data Structure for Beginners

Lecture 2: Lec-2: Introduction to Data Structure with real life examples by #Naina Mam

Lecture 3: Lec-3: Arrays in Data Structure by #Naina Mam | Initialization, Declaration, Memory Representation

Lecture 4: Lec-4: Types of Array | One dimensional & Multi-dimensional Array by #Naina Mam

Lecture 5: Lec-5: Addressing in One Dimensional Array by #Naina Mam | Data Structure

Lecture 6: Lec-6: 2D Arrays | Addressing in 2D Arrays | Row Major Order

Lecture 7: Lec-7: 3D Arrays | Addressing in 3D Arrays | Row Major Order

Lecture 8: Lec-8: Addressing in Lower Triangular Matrix | Data Structure for beginners

Lecture 9: Lec-9: Find 2nd Largest2️⃣ Number in Array | Data Structure for beginners

Lecture 10: Lec-10: Two 2️⃣ Pointer👆 Technique | Two 2️⃣ Sum Problem in Data Structure

Lecture 11: Lec-11: Maximum Sum Subarray Problem | Understand Naive Approach

Lecture 12: Lec-12: Sliding Window 🪟 Technique | Data Structure

Lecture 13: Lec-13: Remove Duplicate Elements in Sorted Array | Various Methods | Data Structure

Lecture 14: Lec-14: Linear Search in Data Structure by #Naina Mam | Time Complexity

Lecture 15: Lec-15: Binary Search in Data Structure by #Naina Mam

Lecture 16: Lec-16: Introduction to Linked List | Types and Need of linked list | data structures

Lecture 17: Lec-17: Arrays vs Linked Lists | Data Structures

Lecture 18: Lec-18: Single Linked List in Data Structures | Self Referential Structure

Lecture 19: Lec-19: The Basic Operations of Linked List | Data Structure

Lecture 20: Lec-20: Traversing in Linked list | Data Structure

Lecture 21: Lec-21: Insert a node at the beginning of Linked list | Data Structure

Lecture 22: Lec-22: Insert a node at the end of Linked List | Data Structure

Lecture 23: Lec-23: Insert a node after a given node in Linked List | Data Structure

Lecture 24: Lec-24: Delete a node from the beginning of Linked List | Data Structure

Lecture 25: Lec-25: Delete a node from the end of Linked List | Data Structure

Lecture 26: Lec-26: Deletion after a given node in Linked List | Data Structure

Lecture 27: Lec-27: Deleting Entire Linked List🔗| Single Linked List🔗| Data Structure

Lecture 28: Lec-28: Introduction to Doubly Linked List | Data Structure

Lecture 29: Lec-29: How to find a Cycle in Linked List | 2 Pointer Algorithm | DS for Beginners

Lecture 30: Lec-30: Introduction to Stack | PUSH and POP operations | Data Structure

Lecture 31: Lec-31: PUSH operation using Array | Implementation of Stack | Data Structure

Lecture 32: Lec-32: POP operation using Array | Implementation of Stack | Data Structure

Lecture 33: Lec-33: PUSH operation using Linked List | Implementation of Stack | Data Structure

Lecture 34: Lec-34: POP operation using Linked List | Implementation of Stack | Data Structure

Lecture 35: Lec-35: Recursion vs Loop | How both approaches work | Data structure for interview preparation

Lecture 36: Lec-36: Infix, Prefix & Postfix👩‍🔧 with examples | Data Structure

Lecture 37: Lec-37: Infix to prefix Conversion | Infix➡️Prefix Conversion with examples | Data Structure

Lecture 38: Lec-38: Infix to Postfix Conversion | Infix➡️Postfix Conversion with examples | Data Structure

Lecture 39: Lec-39: Infix to Prefix conversion using Stack | Data Structure

Lecture 40: Lec-40: Infix to postfix Conversion using Stack | Infix➡️Postfix Conversion with examples

Lecture 41: Lec-41: Practice question on Infix to postfix notation | Data Structure

Lecture 42: Lec-42: Postfix Expression Evaluation | Stack Application | Data Structure

Lecture 43: Lec-43: Practice question on Postfix Evaluation | Stack | Data Structure

Lecture 44: Lec-44: Understanding Call Stack with example | Data Structure #gatesmashers #Stack

Lecture 45: Lec-45: The Magic of Recursion: Understanding the Power of Recursive Functions | Time Complexity

Lecture 46: Lec-46: Introduction to Queue Data structure with real life example | Data Structure #queue

Lecture 47: Lec-47: Enqueue(), Dequeue() & other Operations on Queue | Data Structure

Lecture 48: Lec-48: Dequeue() in Queue using Array | Data Structure #gatesmashers

Lecture 49: Lec-49: isfull() and isempty() in queue | Queue operations | Data Structure

Lecture 50: Lec-50: Implementation of Queue using Array | Enqueue() in Queue | Data Structure #gatesmashers

Lecture 51: Lec-51: Implementation of Queue using Linked List | Enqueue() in Queue | Data Structure

Lecture 52: Lec-52: Introduction to Trees | Binary Tree, Almost Complete Binary Tree, Full BT, Complete

Lecture 53: Lec-53: Binary Search Tree in Data Structure | Insertion and Traversal in BST

Lecture 54: Lec-54: Deletion from Binary Search Tree(BST) with Example | Data Structure

Lecture 55: Lec-55: Find Preorder, Postorder & Inorder of Binary Search Tree(BST) in Data Structure

Lecture 56: Lec-56: Preorder, Inorder and Postorder in 5 minute | Tree Traversal | Easiest and Shortest Trick

Lecture 57: Lec-57: Imp Question on Binary Search Tree | GATE Question | Data Structure

Lecture 58: Lec-58: Introduction to AVL Tree in Data Structure with Examples | All Imp Points of AVL

Lecture 59: Lec-59: How to Create AVL tree | LL, RR, LR, RL Rotation in AVL | Data Structure

Lecture 60: Lec-60: AVL Tree Creation in Data Structure | All Imp Points

Lecture 61: Lec-61: Time Complexities of All Trees | Binary Tree, Binary Search Tree, AVL Tree, Heap Tree

Lecture 62: Lec-62: Introduction to Red-Black Tree | Data Structure for Beginners

Lecture 63: Lec-63: Insertion in Red Black Tree | Data Structure for Beginners

Lecture 64: Lec-64: Topological Order/ Sort in DAG(Direct Acyclic Graph)