Data Structures and Algorithms in C++ - Full Course - 2025 Edition - Beginner to Advanced

Simple Snippets via YouTube

Start learning Write review

Details

Start learning

Provider

YouTube
Pricing

Free Video
Languages

English
Duration & workload

2 days 7 hours 52 minutes
Sessions

On-Demand
Level

Beginner

Found in

Master data structures and algorithms from beginner to advanced level through this comprehensive course covering essential DSA concepts implemented in C++. Learn core data structures including arrays, linked lists, stacks, queues, trees, graphs, and hash tables alongside fundamental algorithms for sorting, searching, recursion, and dynamic programming. Explore abstract data types, algorithm analysis with Big O notation, time and space complexity optimization, and real-world applications through clear explanations, code walkthroughs, flowcharts, and problem-solving exercises. Practice with interview-level questions while building strong logic and coding skills essential for programming success. Cover advanced topics such as AVL trees, B-trees, heap data structures, graph traversal techniques including BFS and DFS, various sorting algorithms from bubble sort to radix sort, expression conversions between infix, prefix, and postfix notations using stacks, and collision resolution techniques in hashing. Gain hands-on experience with complete C++ implementations for each data structure and algorithm, making this course ideal for college students, programming beginners, and anyone preparing for coding interviews.

Syllabus

Introduction to Data Structures & Algorithms | Course Details & Prerequisites
What is Data Structures? & Why we need them? DS Real World Example
What is Abstract Data Types(ADT) in Data Structures ? | with Example
What is an Algorithm ? | Data Structures and Algorithms
What is Stack Data Structure ? | Data Structure and Algorithms (DSA) | Part - 1
Stack Data Structure in C++ Programming (using arrays) | All Stack Operations | Part - 2
What is Queue Data Structure ? | Queue Operations | Data Structure & Algorithms (DSA) | Part - 1
Queue Data Structure in C++ Programming (using arrays) | All Queue Operations | Part - 2
Circular Queue Data Structure with C++ Program Implementation | Data Structures & Algorithms
Linked List Data Structure - How Linked List works | All operations, Types & Applications
Singly Linked List Data Structure with all Operations & Algorithm | Part 1 | DSA
C++ Program to Implement Singly Linked List Data Structure | Part 2 | DSA
Doubly Linked List Data Structure with all Operations & Algorithm | Part 1 | DSA
C++ Program to Implement Doubly Linked List Data Structure (Full Code) | Part - 2 | DSA
Circular Linked List Data Structure with all Operations & Algorithm | Part 1 | DSA
C++ Program to Implement Circular Linked List Data Structure (Full Code) | Part - 2 | DSA
Linear Search Algorithm in Data Structures | C++ Program to Implement Linear Search Algorithm
Binary Search Algorithm (Working, Algorithm & Diagram) in Data Structures | Part 1 | DSA
Binary Search Algorithm C++ Code in Data Structures | Part -2 | DSA
What are Sorting Algorithms | Why we need Sorting Algorithms ? | Data Structures & Algorithms | DSA
Selection Sort Algorithm | How Selection Sort Works with Example | Part - 1 | Sorting Algorithms DS
Selection Sort Algorithm C++ Code in Data Structures | Part -2 | DSA
Insertion Sort Algorithm | How Insertion Sort Works with Example | Part - 1 | Sorting Algorithms DS
Insertion Sort Algorithm C++ Code in Data Structures | Part -2 | DSA
Bubble Sort Algorithm | How Bubble Sort Works with Example | Part - 1 | Sorting Algorithms DS
Bubble Sort Algorithm with C++ Program (Full Code) | Data Structures & Algorithms | Part - 2
Optimized Bubble Sort Algorithm | (Algorithm with C++ Program) | Sorting Algorithms in DS
What is Big O notation & Time Complexity of Algorithms | Algorithm Analysis in Data Structures
Big Oh(O) vs Big Omega(Ω) vs Big Theta(θ) notations | Asymptotic Analysis of Algorithms with Example
Space Complexity of Algorithms - How to Calculate Space Complexity of Algorithms in Data Structures
Merge Sort Algorithm | How Merge Sort Works (Example Diagram) | Part - 1 | Sorting Algorithms - DSA
Merge Sort Algorithm in C++ Programming | (C++ Program) | Part - 2 | Sorting Algorithms - DSA
Quick Sort Algorithm | How Quick Sort Works (Example Diagram) | Part - 1 | Sorting Algorithms - DSA
Quick Sort Algorithm in C++ Programming | (C++ Program) | Part - 2 | Sorting Algorithms - DSA
Counting Sort Sorting Algorithm (Working with Diagram) | Part - 1 | Sorting Algorithms - DSA
Counting Sort Sorting Algorithm (C++ Program) | Part - 2 | Sorting Algorithms - DSA
Radix Sort(Bucket Sort) Sorting Algorithm (Working & Diagram) | Part - 1 | Sorting Algorithms - DSA
Radix Sort Algorithm (Step by Step Dry Running of Pseudocode) | Part - 2 | Sorting Algorithms - DSA
Radix Sort Sorting Algorithm (C++ Program) | Part - 3 | Sorting Algorithms - DSA
Shell Sort Algorithm (Theory + Working + Pseudocode) with Example | Part - 1 | Sorting Algorithms
C++ Program to Implement Shell Sort Algorithm (Full Code) | Part - 2 | Sorting Algorithms
What is Infix Prefix & Postfix Expressions in Data Structures | Why do we need them ?
Why Prefix & Postfix is more efficient than Infix Expressions in algorithms & arithmetic operations?
Infix to Prefix Conversion & vice versa WITHOUT using Stack (With Solved Examples) | Data Structures
Infix to Postfix Conversion & vice versa WITHOUT using Stack(With Solved Examples) | Data Structures
Rules to Convert Infix to Postfix Expression using STACK Data Structure (With Solved Examples) | DSA
PSEUDOCODE of Infix to Postfix Expression using STACK Data Structure (With Solved Example) | DSA
C++ PROGRAM to Convert Infix to Postfix Expression using STACK Data Structure (With Full Code) | DSA
Rules & Pseudocode of Infix to Prefix using Stack Data Structure (with Solved Example) | DSA
C++ PROGRAM to Convert Infix to Prefix Expression using STACK Data Structure (With Full Code) | DSA
Postfix to Infix Expression using STACK Data Structure (With Solved Example) | Rules + Pseudocode
C++ PROGRAM to Convert Postfix to Infix Expression using STACK Data Structure (With Full Code) | DSA
Prefix to Infix Expression using STACK Data Structure (With Solved Example) | Rules + Pseudocode
C++ PROGRAM to Convert Prefix to Infix Expression using STACK Data Structure (With Full Code) | DSA
Postfix to Prefix Conversion & vice versa MANUAL conversion (6 Solved Examples) | Data Structures
How to convert Postfix to Prefix Expression using STACK Data Structure (With Solved Example)
C++ PROGRAM to Convert Postfix to Prefix Expression using STACK Data Structure (Full Code) | DSA
Prefix to Postfix Expression using STACK Data Structure (With Solved Example) | Rules + Pseudocode
C++ PROGRAM to Convert Prefix to Postfix Expression using STACK Data Structure (Full Code) | DSA
Stack using Linked List Implementation | Working + Pseudocode + Diagram | Part - 1
C++ PROGRAM to Implement STACK using SINGLY LINKED LIST | (FULL CODE) | Data structures & Algorithms
Queue Implementation using Linked List Data Structure | Working + Pseudocode + Diagram | Part - 1
C++ Program to Implement Queue using Linked List (FULL CODE with Diagram) | Data structures - Part 2
Circular Queue Implementation using Linked List Data Structure(C++ Program with Diagram Explanation)
Array vs Linked List - Pros & Cons | Which data structure is better & when ? | DSA
What is a Tree? | Introduction to Tree Data Structure (diagram) | Important Tree Terms & Properties
Introduction to Binary Tree Data structure | Properties, variants & modes of implementation | DSA
Binary SEARCH Tree (BST) Data structure | How BST has O(log N) Time Complexity for Searching? | DSA
Binary Search Tree (BST) | Implementation(with Full Code) | Part 1 - Setup
Binary Search Tree (BST) - INSERTION operation(with C++ Code) | Part 2 - Insert New Node Operation
Binary Tree Traversal Techniques(with Diagram) | DFS vs BFS | DFS - Preorder vs Inorder vs Postorder
PreOrder Tree Traversal Technique (Full C++ Code) | DFS Tree Traversal Technique
InOrder Tree Traversal Technique (Working with Diagram & C++ Code) | DFS Tree Traversal Technique
Post Order Tree Traversal Technique (Working with Diagram & C++ Code) | DFS Tree Traversal Technique
Print Binary Tree Data Structure in a Graphical way (with C++ Code) on Command Prompt | DSA
Search Operation in Binary Search Tree (BST) | Iterative Search Technique(Full C++ Code) | DSA
Search Operation in Binary Search Tree (BST) using RECURSION | Recursive Search Technique (C++ Code)
Find Height of a Binary Tree using Recursive Function | Recursion approach | BST Implemenation | DSA
Breadth First Search (BFS) aka (Level Order Tree) Traversal in Binary Tree (With Full C++ Code)
Delete Node Operation in Binary Search Tree (BST) | Working + Pseudocode (With Full C++ Code) | DSA
What is Balancing a binary tree and why do we need balancing
What is AVL tree ? 4 Basic Rotations(Left, Right, Left-Right, Right-Left) for Balancing with Diagram
AVL tree Rotations - (LL RR LR RL) with more than 3 Nodes with (Diagram & Example | DSA
AVL Tree Insertion Example(2 Solved Problems) with Diagram & Explanation | AVL trees - DSA
AVL Tree Deletion Working with Diagram & Explanation (1 Solved Problem) | AVL trees - DSA
Insertion in Binary Search Tree (BST) using RECURSIVE FUNCTION (Working with Diagram) | DSA
Working of AVL Tree Insertion Operation(Recursive Method) with Rotations & Full C++ Program Code
AVL Tree Deletion Operation(Recursive Method) with Rotations & Full C++ Program Code
AVL Tree ALL Operation(Insertion, Deletion, Rotations, Balance factor, Searching) with Full C++ Code
What is Heap Data Structure | Types, Applications, Implementation & Standard Heap Operations
Heap Data Structure Implementation using Arrays | C++ Program Setup(Part - 1) | Min Heap
Insertion in Heap Data Structure - Step by Step Working with Diagram (With Full C++ Code) |
ExtractMin and Heapify in Heap Data Structure - Step by Step Working with Diagram (Full C++ Code)
Delete Key Operation in Heap Data Structure - Step by Step Working with Diagram (Full C++ Code)
Heapsort Sorting Algorithm (Min Heap) with Working & Pseudocode | (Full C++ Program)
Introduction to Graph Data Structure - What is a Graph ? | Tress vs Graphs | Types & Real Examples
Introduction to Graph Data Structure - Graph Properties & Terminologies
Adjacency Matrix in Graph Data Structure | Graph Implementation
Adjacency List in Graph Data Structure | Graph Implementation
Graph Traversal techniques - Breadth First (BFS) vs Depth First (DFS)
Graph Data Structure (C++ Code Implementation - Part 1) | Adjacency List Implementation
Graph DS - Add Vertex Operation (C++ Code Implementation - Part 2) | Adjacency List Implementation
Graph DS - Add Edge Operation (C++ Code Implementation - Part 3) | Adjacency List Implementation
Graph DS - Print Graph Operation (C++ Code Implementation - Part 4) | Adjacency List Implementation
Graph DS - Update Edge Graph Operation (C++ Code - Part 5) | Adjacency List Implementation
Graph DS - Delete Edge Graph Operation (C++ Code - Part 6) | Adjacency List Implementation
Graph DS - Delete Vertex Graph Operation (C++ Code - Part 7) | Adjacency List Implementation
Graph DS - Update Vertex Graph Operation (C++ Code - Part 8) | Adjacency List Implementation
Graph DS - Print all Neighbours of a Vertex (C++ Code - Part 8) | Adjacency List Implementation
M-way(Multiway) tree & M-way Search Data structure | Binary Search tree VS M-way Search Tree | DSA
M-way Search Tree Data structure | Insertion & Deletion Operations | DSA
B-Tree Data structure | Introduction & Properties | DSA
B-Tree Data structure | Insertion Process with Example | DSA
Deleting Key in B-Tree Data structure | Deletion Process with Example | DSA
What is HASHING ? | Why do we NEED it? | What is a Hash Function | (Example - Array vs Hash Table)
What is COLLISION in Hashing? | WHY Collision occurs in Hashing ? | Collision Control & Resolution
Separate Chaining (Open Hashing) | Collision Control | Hashing in Data Structures
Closed Hashing - (Linear Probing, Quadratic Probing & Double Hashing) | Collision Control