Data Structure
5.0
(1)
37 learners
What you'll learn
This course includes
- 11.3 hours of video
- Certificate of completion
- Access on mobile and TV
Course content
1 modules • 66 lessons • 11.3 hours of video
Data Structure
66 lessons
• 11.3 hours
Data Structure
66 lessons
• 11.3 hours
- Lec-1: Roadmap 🛣️ of DSA | Syllabus of Data structure | Data Structure for Beginners 10:20
- Lec-2: Introduction to Data Structure with real life examples by #Naina Mam 05:21
- Lec-3: Arrays in Data Structure by #Naina Mam | Initialization, Declaration, Memory Representation 11:07
- Lec-4: Types of Array | One dimensional & Multi-dimensional Array by #Naina Mam 09:17
- Lec-5: Addressing in One Dimensional Array by #Naina Mam | Data Structure 07:32
- Lec-6: 2D Arrays | Addressing in 2D Arrays | Row Major Order 08:21
- Lec-7: 3D Arrays | Addressing in 3D Arrays | Row Major Order 12:08
- Lec-8: Addressing in Lower Triangular Matrix | Data Structure for beginners 10:48
- Lec-9: Find 2nd Largest2️⃣ Number in Array | Data Structure for beginners 09:00
- Lec-10: Two 2️⃣ Pointer👆 Technique | Two 2️⃣ Sum Problem in Data Structure 10:33
- Lec-11: Maximum Sum Subarray Problem | Understand Naive Approach 16:20
- Lec-12: Sliding Window 🪟 Technique | Data Structure 13:10
- Lec-13: Remove Duplicate Elements in Sorted Array | Various Methods | Data Structure 09:05
- Lec-14: Linear Search in Data Structure by #Naina Mam | Time Complexity 12:28
- Lec-15: Binary Search in Data Structure by #Naina Mam 10:33
- Lec-16: Introduction to Linked List | Types and Need of linked list | data structures 10:17
- Lec-17: Arrays vs Linked Lists | Data Structures 08:41
- Lec-18: Single Linked List in Data Structures | Self Referential Structure 08:27
- Lec-19: The Basic Operations of Linked List | Data Structure 08:28
- Lec-20: Traversing in Linked list | Data Structure 12:38
- Lec-21: Insert a node at the beginning of Linked list | Data Structure 10:44
- Lec-22: Insert a node at the end of Linked List | Data Structure 14:45
- Lec-23: Insert a node after a given node in Linked List | Data Structure 13:39
- Lec-24: Delete a node from the beginning of Linked List | Data Structure 06:05
- Lec-25: Delete a node from the end of Linked List | Data Structure 12:53
- Lec-26: Deletion after a given node in Linked List | Data Structure 09:46
- Lec-27: Deleting Entire Linked List🔗| Single Linked List🔗| Data Structure 10:23
- Lec-28: Introduction to Doubly Linked List | Data Structure 09:57
- Lec-29: How to find a Cycle in Linked List | 2 Pointer Algorithm | DS for Beginners 06:43
- Lec-30: Introduction to Stack | PUSH and POP operations | Data Structure 06:46
- Lec-31: PUSH operation using Array | Implementation of Stack | Data Structure 08:05
- Lec-32: POP operation using Array | Implementation of Stack | Data Structure 07:32
- Lec-33: PUSH operation using Linked List | Implementation of Stack | Data Structure 14:29
- Lec-34: POP operation using Linked List | Implementation of Stack | Data Structure 06:44
- Lec-35: Recursion vs Loop | How both approaches work | Data structure for interview preparation 06:25
- Lec-36: Infix, Prefix & Postfix👩🔧 with examples | Data Structure 13:33
- Lec-37: Infix to prefix Conversion | Infix➡️Prefix Conversion with examples | Data Structure 07:26
- Lec-38: Infix to Postfix Conversion | Infix➡️Postfix Conversion with examples | Data Structure 12:21
- Lec-39: Infix to Prefix conversion using Stack | Data Structure 09:19
- Lec-40: Infix to postfix Conversion using Stack | Infix➡️Postfix Conversion with examples 15:15
- Lec-41: Practice question on Infix to postfix notation | Data Structure 07:17
- Lec-42: Postfix Expression Evaluation | Stack Application | Data Structure 10:52
- Lec-43: Practice question on Postfix Evaluation | Stack | Data Structure 06:16
- Lec-44: Understanding Call Stack with example | Data Structure #gatesmashers #Stack 08:52
- Lec-45: The Magic of Recursion: Understanding the Power of Recursive Functions | Time Complexity 13:54
- Lec-46: Introduction to Queue Data structure with real life example | Data Structure #queue 09:05
- Lec-47: Enqueue(), Dequeue() & other Operations on Queue | Data Structure 09:32
- Lec-48: Dequeue() in Queue using Array | Data Structure #gatesmashers 12:13
- Lec-49: isfull() and isempty() in queue | Queue operations | Data Structure 07:27
- Lec-50: Implementation of Queue using Array | Enqueue() in Queue | Data Structure #gatesmashers 13:15
- Lec-51: Implementation of Queue using Linked List | Enqueue() in Queue | Data Structure 11:35
- Lec-52: Introduction to Trees | Binary Tree, Almost Complete Binary Tree, Full BT, Complete 10:45
- Lec-53: Binary Search Tree in Data Structure | Insertion and Traversal in BST 11:02
- Lec-54: Deletion from Binary Search Tree(BST) with Example | Data Structure 08:36
- Lec-55: Find Preorder, Postorder & Inorder of Binary Search Tree(BST) in Data Structure 09:39
- Lec-56: Preorder, Inorder and Postorder in 5 minute | Tree Traversal | Easiest and Shortest Trick 06:47
- Lec-57: Imp Question on Binary Search Tree | GATE Question | Data Structure 11:21
- Lec-58: Introduction to AVL Tree in Data Structure with Examples | All Imp Points of AVL 09:54
- Lec-59: How to Create AVL tree | LL, RR, LR, RL Rotation in AVL | Data Structure 10:46
- Lec-60: AVL Tree Creation in Data Structure | All Imp Points 12:53
- Lec-61: Time Complexities of All Trees | Binary Tree, Binary Search Tree, AVL Tree, Heap Tree 11:47
- Lec-62: Introduction to Red-Black Tree | Data Structure for Beginners 09:13
- Lec-63: Insertion in Red Black Tree | Data Structure for Beginners 22:52
- Lec-64: Topological Order/ Sort in DAG(Direct Acyclic Graph) 06:44
- LEC-65 : How to Find Cycle in Undirected Graph using DFS 08:13
- LEC-66 : How to Find Cycle in Directed Graph using DFS 09:30
Take this course with you
Download the app to continue lessons from your phone anytime.
