Data Structures(DS) Full Course (Hindi) (Part 1)

   Friday, October 10, 2025   

Starting a new Lecture Notes Series on Data Structures(DS) Full Course

Youtube Lecture Playlist Credits 

Channel Name: Easy Engineering Classes

So Let Us Start to This Journey of Learning 

Data Structures(DS) Full Course By Lecture Notes together!

Lecture 1: L1: Data Structures Introduction | Datatypes, Abstract Datatype(ADT) | Data Structures Lectures

Lecture 2: L2: Algorithm, Comparison , Rate of Growth, Best, Worst, Average Case Analysis | Data Structures

Lecture 3: L3: Asymptotic notations - Big O, Big Omega and Big Theta | Data Structures Lectures in Hindi

Lecture 4: L4: Rules for Determining Algorithm Running Time | Loops, If then else | Data Structures Lectures

Lecture 5: L5: Recursion and Backtracking | Important Questions | Data Structures Lectures in Hindi

Lecture 6: L6: Arrays Introduction | 1D Array, Linear Array Address, Initialization | Data Structures Lectures

Lecture 7: L7: Array Traversal | Array Operations | Examples | Data Structures Lectures in Hindi

Lecture 8: L8: Inserting Elements in Array | Appending | Inserting in Middle | Data Structures Lectures Hindi

Lecture 9: L9: Deleting Elements from Array | Deletion from Middle | Examples | Data Structures Lectures Hindi

Lecture 10: L10: Merging of Sorted and Unsorted Array | Examples | Data Structures Lectures Hindi

Lecture 11: L11: 2D Array Introduction | Row & Column Major Address | Examples | Data Structures Lectures Hindi

Lecture 12: L12: 2D Array Operations | Transpose, Sum, Difference, Product | Data Structures Lectures Hindi

Lecture 13: L13: Sparse Matrix | Representation using Arrays and Linked List | Data Structures Lectures Hindi

Lecture 14: L14: Stack Introduction | PUSH and POP Operation | Examples | Data Structures Lectures Hindi

Lecture 15: L15: Find element at particular position after 3 push and 1 pop operation | Stack Question

Lecture 16: L17: Infix to Prefix Expression Conversion with Example | Data Structures Lectures Hindi

Lecture 17: L18: Infix to Postfix Expression Conversion with Example | Data Structures Lectures Hindi

Lecture 18: L19: Evaluation of Prefix Expression with Example | Data Structures Lectures Hindi

Lecture 19: L20: Evaluation of Postfix Expression with Example | Data Structures Lectures Hindi

Lecture 20: L21: Solved Question on Evaluation of Postfix Expression using Stack | Data Structures Lectures

Lecture 21: L22: Queue Introduction | Insertion and Deletion of Elements | Data Structures Lectures in Hindi

Lecture 22: L23: Circular Queue Introduction | Insertion, Deletion of Elements | Data Structures Lectures Hindi

Lecture 23: L24: Double Ended Queue Introduction | DEQUEUE Types | Data Structures Lectures Hindi

Lecture 24: L25: Priority Queue Introduction | Implementation with Example | Types | Data Structures Lectures

Lecture 25: L26: Linked List Introduction | Singly Linked List Representation | Data Structures Lectures Hindi

Lecture 26: L27: Inserting Node at Beginning, End, Middle of Linked list | Data Structures Lectures Hindi

Lecture 27: L28: Deleting Node from Beginning, End, Middle of Linked list | Data Structures Lectures Hindi

Lecture 28: L29: Doubly Linked List | Circular Doubly Linked List | Examples | Data Structures in Lectures Hindi

Lecture 29: L30: Circular Linked List | Node Insertion Example | Data Structures in Lectures Hindi

Lecture 30: L31: Addition of Two Polynomials using Linked List with Example | Data Structures in Lectures Hindi

Lecture 31: L32: Trees in Data Structure | Introduction with Example | Data Structures in Lectures Hindi

Lecture 32: L33: Binary Tree Introduction | Types of Binary Tree | Data Structures in Lectures Hindi

Lecture 33: L34: Binary Tree Traversal | Preorder, Inorder, Postorder, Levelorder | Data Structures Lectures

Lecture 34: L35: Construction of Binary Tree from PostOrder and InOrder Traversal | Examples | Data Structures

Lecture 35: L36: Construction of Binary Tree from PreOrder and InOrder Traversal | Examples | Data Structures

Lecture 36: L37: Practice Problem on Tree Construction from PreOrder and InOrder Traversal | Data Structures

Lecture 37: L38: Construction of Binary Tree from PostOrder and PreOrder Traversal | Data Structures Lectures

Lecture 38: L39: Creating Binary Tree from Depth First Order and Symmetric Order Traversals | Data Structures

Lecture 39: L42: Binary Search Tree(BST) Introduction | Operations | Data Structures Lectures Hindi

Lecture 40: L43: Insert and Search Operation in Binary Search Tree(BST) | Data Structures Lectures Hindi

Lecture 41: L44: Deletion in Binary Search Tree(BST) with example | Data Structures Lectures Hindi

Lecture 42: L45: AVL Trees Introduction | Rotation and Insert Example in AVL Tree | Data Structures Lectures

Lecture 43: L47: Heaps Introduction | Construction of Heap with Example | Data Structures Lectures in Hindi

Lecture 44: L48: Deletion in Max Heap with Example | Data Structures Lectures in Hindi

Lecture 45: L49: Multiway trees(M-Way Tree) Introduction | Creating 3 Way Search Tree Example | Data Structures

Lecture 46: L50: Solved Question Creating 3-Way Search Tree for given list of keys | Data Structures Lectures

Lecture 47: L51: 2-3 Trees Introduction | Inserting Data Elements in 2-3 Tree Example | Data Structures Lectures

Lecture 48: L52: 2-3-4 Trees Introduction | Inserting Data Elements in Example | Data Structures Lectures Hindi