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