Data Structures & Algorithms in C++ – Full Course (2025 Edition | Beginner to Advanced)
5.0
(0)
16 learners
What you'll learn
This course includes
- 55.5 hours of video
- Certificate of completion
- Access on mobile and TV
Course content
1 modules • 118 lessons • 55.5 hours of video
Data Structures & Algorithms in C++ – Full Course (2025 Edition | Beginner to Advanced)
118 lessons
• 55.5 hours
Data Structures & Algorithms in C++ – Full Course (2025 Edition | Beginner to Advanced)
118 lessons
• 55.5 hours
- Introduction to Data Structures & Algorithms | Course Details & Prerequisites 06:22
- What is Data Structures? & Why we need them? DS Real World Example 15:27
- What is Abstract Data Types(ADT) in Data Structures ? | with Example 10:16
- What is an Algorithm ? | Data Structures and Algorithms 08:26
- What is Stack Data Structure ? | Data Structure and Algorithms (DSA) | Part - 1 15:12
- Stack Data Structure in C++ Programming (using arrays) | All Stack Operations | Part - 2 38:04
- What is Queue Data Structure ? | Queue Operations | Data Structure & Algorithms (DSA) | Part - 1 26:38
- Queue Data Structure in C++ Programming (using arrays) | All Queue Operations | Part - 2 25:38
- Circular Queue Data Structure with C++ Program Implementation | Data Structures & Algorithms 26:44
- Linked List Data Structure - How Linked List works | All operations, Types & Applications 19:50
- Singly Linked List Data Structure with all Operations & Algorithm | Part 1 | DSA 27:49
- C++ Program to Implement Singly Linked List Data Structure | Part 2 | DSA 01:01:59
- Doubly Linked List Data Structure with all Operations & Algorithm | Part 1 | DSA 35:52
- C++ Program to Implement Doubly Linked List Data Structure (Full Code) | Part - 2 | DSA 46:32
- Circular Linked List Data Structure with all Operations & Algorithm | Part 1 | DSA 32:41
- C++ Program to Implement Circular Linked List Data Structure (Full Code) | Part - 2 | DSA 42:07
- Linear Search Algorithm in Data Structures | C++ Program to Implement Linear Search Algorithm 15:19
- Binary Search Algorithm (Working, Algorithm & Diagram) in Data Structures | Part 1 | DSA 21:35
- Binary Search Algorithm C++ Code in Data Structures | Part -2 | DSA 14:50
- What are Sorting Algorithms | Why we need Sorting Algorithms ? | Data Structures & Algorithms | DSA 10:20
- Selection Sort Algorithm | How Selection Sort Works with Example | Part - 1 | Sorting Algorithms DS 20:29
- Selection Sort Algorithm C++ Code in Data Structures | Part -2 | DSA 10:57
- Insertion Sort Algorithm | How Insertion Sort Works with Example | Part - 1 | Sorting Algorithms DS 24:29
- Insertion Sort Algorithm C++ Code in Data Structures | Part -2 | DSA 11:12
- Bubble Sort Algorithm | How Bubble Sort Works with Example | Part - 1 | Sorting Algorithms DS 21:41
- Bubble Sort Algorithm with C++ Program (Full Code) | Data Structures & Algorithms | Part - 2 10:08
- Optimized Bubble Sort Algorithm | (Algorithm with C++ Program) | Sorting Algorithms in DS 26:10
- What is Big O notation & Time Complexity of Algorithms | Algorithm Analysis in Data Structures 39:21
- Big Oh(O) vs Big Omega(Ω) vs Big Theta(θ) notations | Asymptotic Analysis of Algorithms with Example 28:50
- Space Complexity of Algorithms - How to Calculate Space Complexity of Algorithms in Data Structures 28:08
- Merge Sort Algorithm | How Merge Sort Works (Example Diagram) | Part - 1 | Sorting Algorithms - DSA 53:29
- Merge Sort Algorithm in C++ Programming | (C++ Program) | Part - 2 | Sorting Algorithms - DSA 24:35
- Quick Sort Algorithm | How Quick Sort Works (Example Diagram) | Part - 1 | Sorting Algorithms - DSA 48:23
- Quick Sort Algorithm in C++ Programming | (C++ Program) | Part - 2 | Sorting Algorithms - DSA 20:09
- Counting Sort Sorting Algorithm (Working with Diagram) | Part - 1 | Sorting Algorithms - DSA 39:44
- Counting Sort Sorting Algorithm (C++ Program) | Part - 2 | Sorting Algorithms - DSA 15:38
- Radix Sort(Bucket Sort) Sorting Algorithm (Working & Diagram) | Part - 1 | Sorting Algorithms - DSA 23:51
- Radix Sort Algorithm (Step by Step Dry Running of Pseudocode) | Part - 2 | Sorting Algorithms - DSA 54:08
- Radix Sort Sorting Algorithm (C++ Program) | Part - 3 | Sorting Algorithms - DSA 14:05
- Shell Sort Algorithm (Theory + Working + Pseudocode) with Example | Part - 1 | Sorting Algorithms 44:03
- C++ Program to Implement Shell Sort Algorithm (Full Code) | Part - 2 | Sorting Algorithms 20:12
- What is Infix Prefix & Postfix Expressions in Data Structures | Why do we need them ? 22:15
- Why Prefix & Postfix is more efficient than Infix Expressions in algorithms & arithmetic operations? 16:51
- Infix to Prefix Conversion & vice versa WITHOUT using Stack (With Solved Examples) | Data Structures 28:34
- Infix to Postfix Conversion & vice versa WITHOUT using Stack(With Solved Examples) | Data Structures 29:19
- Rules to Convert Infix to Postfix Expression using STACK Data Structure (With Solved Examples) | DSA 31:19
- PSEUDOCODE of Infix to Postfix Expression using STACK Data Structure (With Solved Example) | DSA 52:06
- C++ PROGRAM to Convert Infix to Postfix Expression using STACK Data Structure (With Full Code) | DSA 27:25
- Rules & Pseudocode of Infix to Prefix using Stack Data Structure (with Solved Example) | DSA 35:51
- C++ PROGRAM to Convert Infix to Prefix Expression using STACK Data Structure (With Full Code) | DSA 29:05
- Postfix to Infix Expression using STACK Data Structure (With Solved Example) | Rules + Pseudocode 32:33
- C++ PROGRAM to Convert Postfix to Infix Expression using STACK Data Structure (With Full Code) | DSA 15:16
- Prefix to Infix Expression using STACK Data Structure (With Solved Example) | Rules + Pseudocode 29:32
- C++ PROGRAM to Convert Prefix to Infix Expression using STACK Data Structure (With Full Code) | DSA 15:38
- Postfix to Prefix Conversion & vice versa MANUAL conversion (6 Solved Examples) | Data Structures 31:07
- How to convert Postfix to Prefix Expression using STACK Data Structure (With Solved Example) 21:42
- C++ PROGRAM to Convert Postfix to Prefix Expression using STACK Data Structure (Full Code) | DSA 13:42
- Prefix to Postfix Expression using STACK Data Structure (With Solved Example) | Rules + Pseudocode 24:33
- C++ PROGRAM to Convert Prefix to Postfix Expression using STACK Data Structure (Full Code) | DSA 13:56
- Stack using Linked List Implementation | Working + Pseudocode + Diagram | Part - 1 50:10
- C++ PROGRAM to Implement STACK using SINGLY LINKED LIST | (FULL CODE) | Data structures & Algorithms 42:39
- Queue Implementation using Linked List Data Structure | Working + Pseudocode + Diagram | Part - 1 54:35
- C++ Program to Implement Queue using Linked List (FULL CODE with Diagram) | Data structures - Part 2 41:39
- Circular Queue Implementation using Linked List Data Structure(C++ Program with Diagram Explanation) 38:08
- Array vs Linked List - Pros & Cons | Which data structure is better & when ? | DSA 48:21
- What is a Tree? | Introduction to Tree Data Structure (diagram) | Important Tree Terms & Properties 32:16
- Introduction to Binary Tree Data structure | Properties, variants & modes of implementation | DSA 30:25
- Binary SEARCH Tree (BST) Data structure | How BST has O(log N) Time Complexity for Searching? | DSA 39:29
- Binary Search Tree (BST) | Implementation(with Full Code) | Part 1 - Setup 25:08
- Binary Search Tree (BST) - INSERTION operation(with C++ Code) | Part 2 - Insert New Node Operation 51:40
- Binary Tree Traversal Techniques(with Diagram) | DFS vs BFS | DFS - Preorder vs Inorder vs Postorder 27:31
- PreOrder Tree Traversal Technique (Full C++ Code) | DFS Tree Traversal Technique 34:59
- InOrder Tree Traversal Technique (Working with Diagram & C++ Code) | DFS Tree Traversal Technique 34:30
- Post Order Tree Traversal Technique (Working with Diagram & C++ Code) | DFS Tree Traversal Technique 36:36
- Print Binary Tree Data Structure in a Graphical way (with C++ Code) on Command Prompt | DSA 32:09
- Search Operation in Binary Search Tree (BST) | Iterative Search Technique(Full C++ Code) | DSA 29:54
- Search Operation in Binary Search Tree (BST) using RECURSION | Recursive Search Technique (C++ Code) 23:07
- Find Height of a Binary Tree using Recursive Function | Recursion approach | BST Implemenation | DSA 36:18
- Breadth First Search (BFS) aka (Level Order Tree) Traversal in Binary Tree (With Full C++ Code) 50:04
- Delete Node Operation in Binary Search Tree (BST) | Working + Pseudocode (With Full C++ Code) | DSA 01:10:34
- What is Balancing a binary tree and why do we need balancing 25:39
- What is AVL tree ? 4 Basic Rotations(Left, Right, Left-Right, Right-Left) for Balancing with Diagram 30:49
- AVL tree Rotations - (LL RR LR RL) with more than 3 Nodes with (Diagram & Example | DSA 26:05
- AVL Tree Insertion Example(2 Solved Problems) with Diagram & Explanation | AVL trees - DSA 48:02
- AVL Tree Deletion Working with Diagram & Explanation (1 Solved Problem) | AVL trees - DSA 26:48
- Insertion in Binary Search Tree (BST) using RECURSIVE FUNCTION (Working with Diagram) | DSA 35:30
- Working of AVL Tree Insertion Operation(Recursive Method) with Rotations & Full C++ Program Code 49:15
- AVL Tree Deletion Operation(Recursive Method) with Rotations & Full C++ Program Code 45:58
- AVL Tree ALL Operation(Insertion, Deletion, Rotations, Balance factor, Searching) with Full C++ Code 08:06
- What is Heap Data Structure | Types, Applications, Implementation & Standard Heap Operations 19:07
- Heap Data Structure Implementation using Arrays | C++ Program Setup(Part - 1) | Min Heap 20:58
- Insertion in Heap Data Structure - Step by Step Working with Diagram (With Full C++ Code) | 27:15
- ExtractMin and Heapify in Heap Data Structure - Step by Step Working with Diagram (Full C++ Code) 31:45
- Delete Key Operation in Heap Data Structure - Step by Step Working with Diagram (Full C++ Code) 23:52
- Heapsort Sorting Algorithm (Min Heap) with Working & Pseudocode | (Full C++ Program) 20:56
- Introduction to Graph Data Structure - What is a Graph ? | Tress vs Graphs | Types & Real Examples 19:12
- Introduction to Graph Data Structure - Graph Properties & Terminologies 14:22
- Adjacency Matrix in Graph Data Structure | Graph Implementation 22:09
- Adjacency List in Graph Data Structure | Graph Implementation 22:21
- Graph Traversal techniques - Breadth First (BFS) vs Depth First (DFS) 23:18
- Graph Data Structure (C++ Code Implementation - Part 1) | Adjacency List Implementation 35:07
- Graph DS - Add Vertex Operation (C++ Code Implementation - Part 2) | Adjacency List Implementation 26:08
- Graph DS - Add Edge Operation (C++ Code Implementation - Part 3) | Adjacency List Implementation 42:47
- Graph DS - Print Graph Operation (C++ Code Implementation - Part 4) | Adjacency List Implementation 26:49
- Graph DS - Update Edge Graph Operation (C++ Code - Part 5) | Adjacency List Implementation 34:29
- Graph DS - Delete Edge Graph Operation (C++ Code - Part 6) | Adjacency List Implementation 26:36
- Graph DS - Delete Vertex Graph Operation (C++ Code - Part 7) | Adjacency List Implementation 18:31
- Graph DS - Update Vertex Graph Operation (C++ Code - Part 8) | Adjacency List Implementation 13:13
- Graph DS - Print all Neighbours of a Vertex (C++ Code - Part 8) | Adjacency List Implementation 18:27
- M-way(Multiway) tree & M-way Search Data structure | Binary Search tree VS M-way Search Tree | DSA 24:05
- M-way Search Tree Data structure | Insertion & Deletion Operations | DSA 24:04
- B-Tree Data structure | Introduction & Properties | DSA 12:10
- B-Tree Data structure | Insertion Process with Example | DSA 17:55
- Deleting Key in B-Tree Data structure | Deletion Process with Example | DSA 28:00
- What is HASHING ? | Why do we NEED it? | What is a Hash Function | (Example - Array vs Hash Table) 26:41
- What is COLLISION in Hashing? | WHY Collision occurs in Hashing ? | Collision Control & Resolution 08:30
- Separate Chaining (Open Hashing) | Collision Control | Hashing in Data Structures 13:35
- Closed Hashing - (Linear Probing, Quadratic Probing & Double Hashing) | Collision Control 31:06
Take this course with you
Download the app to continue lessons from your phone anytime.
