Videos in this playlist 80 1.1 Arrays in Data Structure | Declaration, Initialization, Memory representation 1.2 Array Operations - Traversal, Insertion | Explanation with C Program | DSA Course 1.3 Array Operations | Deletion from Array | Explanation with Code | Data Structure 1.4 Pointers and Arrays | Data structure Tutorials 1.5 Introduction to Two Dimensional (2D) Arrays | Implementation of 2D Arrays |Memory representation 1.6 Pointers and 2-D Arrays | Two dimensional Array | Data Structures & Algorithm Tutorials 2.1 Introduction to Linked List | Need of Linked List | DSA Tutorials 2.2 Types of Linked List in Data Structures | DSA Full Course 2.3 Arrays vs Linked List | Data structures 2.4 Linked List Implementation in C/C++ | Creation and Display | DSA Tutorials 2.5 Insertion of a Node in Linked List(at Beginning,End,Specified Position)with Code | DSA Tutorials 2.6 Deletion of a node from Linked List (from beginning, end, specified position) | DSA Tutorials 2.7 Find length of Linked List- Iterative approach | DSA Tutorials 2.8 Reverse a Linked List - Iterative Method | Data Structure Tutorials 2.9 Introduction to Doubly Linked List in Data structures | DSA Tutorials 2.10 Implementation of Doubly Linked List - Data Structures 2.11 Insertion in Doubly Linked List(beginning, end, specific position) | Data Structures 2.12 Deletion from Doubly Linked List (beginning,end,specific position) | Data Structures Tutorials 2.13 Reverse a Doubly Linked List | Data Structures & Algorithm Tutorials 2.14 Circular Linked List in Data Structure | Creation and Display | DSA Course 2.15 Implementation of Circular linked list in C | Data Structure Tutorials 2.16 Insertion in Circular Linked List | Data Structure Tutorials 2.17 Deletion of a Node from Circular Linked List(beginning, end, given position) | DSA Tutorials 2.18 Reverse a Circular Linked List | Data Structure Tutorials 2.19 Implementation of Doubly Circular Linked List| Creation and Display | Data Structures 2.20 Insertion in Doubly Circular Linked List | Data Structure & Algorithm Tutorials 2.21 Deletion from Doubly Circular Linked List | Data Structure & Algorithm Course 3.1 Stack in Data Structure | Introduction to Stack | Data Structures Tutorials 3.2 Implementation of Stack using Array | Data Structure and Algorithm Tutorials 3.3 Stack implementation using Linked List | Data Structures and Algorithm Tutorials 3.4 Infix Prefix and Postfix expressions | Data Structures Tutorials 3.5 Infix to Postfix Conversion Rules using Stack | Data structures Tutorials 3.6 Infix to Postfix using Stack | Data Structure and Algorithm 3.7 Infix to Postfix conversion using Stack | Data structures and algorithms 3.8 Infix to Prefix using Stack | Data Structures Tutorials 3.9 Evaluation of Prefix and Postfix expressions using Stack | Data Structures 3.10 Postfix Expression Evaluation using Stack | Data Structures and Algorithms 3.11 Prefix to Infix Conversion | Postfix to Infix Conversion | Data structure Tutorials 3.12 Expression Trees | Binary Expression Tree | Data Structures Tutorials 3.13 Expression Tree from Postfix | Data Structures Tutorials 4.1 Queue in Data Structure | Introduction to Queue | Data Structures Tutorials 4.2 Implementation of Queue using Arrays | Data Structures & Algorithm Tutorials 4.3 Queue Implementation using Linked List in C | Data Structure Tutorials 4.4 Circular Queue in Data Structure | Circular Queue using Arrays in C | DSA Tutorials 4.5 Circular Queue in Data Structure | Circular Queue using Linked List | DSA Tutorials 4.6 Implement Queue using Stack in C| Data Structures Tutorials 4.7 DEQUE in Data Structure | Introduction to DEQue - Double Ended Queue 4.8 Implementation of DEQUE using Circular Array | Data Structures Tutorials 5.1 Tree in Data Structure | Introduction to Trees | Data Structures Tutorials 5.2 Binary Tree in Data Structure| Types of Binary Tree| Data Structures Tutorials 5.3 Binary Tree Implementation in C Program | Data Structures Tutorials 5.4 Binary Tree Representation |Array representation of Binary Tree | Data Structure 5.5 Binary Tree Traversals (Inorder, Preorder and Postorder) | Data structures and algorithms 5.6 Binary Tree traversal | Preorder, Inorder, Postorder | Data Structures Tutorials 5.7 Construct Binary Tree from Preorder and Inorder Traversal | Example | Data Structures Tutorials 5.8 Construct Binary Tree from Postorder and Inorder with example | Data structures Course 5.9 Construct Binary Tree from Preorder and Postorder traversal | Data Structure Tutorials 5.10 Binary Search Trees (BST) - Insertion and Deletion | DSA Full Course 5.11 Construct Binary Search Tree(BST) from Preorder example |Data Structures & Algorithm 5.12 Construct Binary Search Tree(BST) from Postorder Traversal | Data structures 5.13 AVL Tree - Insertion, Rotations(LL, RR, LR, RL) with Example | Data Structure Tutorials 5.14 AVL Tree Insertion | with Solved Example | Data Structures & Algorithm Tutorials 5.15 AVL Tree Deletion in Data structures | with Example | DSA Tutorials 5.16 Red Black tree | Introduction to Red Black trees | DSA Tutorials 5.17 Red Black Tree Insertion | Insertion Algorithm | Data Structure Tutorials 5.18 Red Black Tree Deletion | DSA Tutorials for Beginners 5.19 Splay Tree Introduction | Data structure & Algorithm 5.20 Splay Tree Insertion | Data structure 5.21 Splay Trees Deletion | Bottom-up Splaying | Data Structure & Algorithm 5.22 Splay Tree Deletion | Top Down Splaying | Data Structure & Algorithm 5.23 Introduction to B-Trees | Data Structures & Algorithm Tutorials 5.24 Insertion in B-tree of Order 3 | B-Tree Example | Data structures and algorithms 5.25 Insertion in B-Tree of Order 5 | Data structures and algorithms Tutorials 5.26 Insertion in B-Tree of Order 5 with Given Alphabets | Data structures and algorithms 5.27 Insertion in B-Tree of Order 4 (Data Structure) 5.28 B-Tree Deletion in Data Structures | DSA Tutorials 5.29 B+ Tree Insertion | B+ Tree Creation example | Data Structure Tutorials 5.30 B+ Tree Deletion| with example |Data structure & Algorithm Tutorials 5.31 B+ Tree Insertion | Create B+ Tree of Order 5 | Data Structures Tutorials 6.1 Graph Representation in Data Structure(Graph Theory)|Adjacency Matrix and Adjacency List Show all 80 Advantages and disadvantages AdvantagesFree and complete: every lecture is in the playlist, in order. Watch at 1.5x, skip what you know, rewatch what you don't. Taught in Hindi (or Hinglish), which many students find easier to follow. Made for Indian students, with placement and exam context. 4,914,766 views, so help and notes are easy to find. Completely free. Self-paced: start any time. A clear syllabus (80 videos) you can see before you start. DisadvantagesNo certificate, deadlines or graded work. Quality and depth vary: check that the playlist is finished before you start. Less depth than a university course on some topics. No certificate. No graded assignments or feedback. Recorded in 2019: tools may have changed since. Some points apply to every course of this kind; see how we rank .
FreeFree: Watch on YouTube, no account needed.Certificate: None. Code or take notes along to make it stick.