Completed
Introduction to Data Structures & Algorithms
Class Central Classrooms beta
YouTube playlists curated by Class Central.
Classroom Contents
Data Structures and Algorithms Course in Hindi
Automatically move to the next video in the Classroom when playback concludes
- 1 Introduction to Data Structures & Algorithms
- 2 Time Complexity and Big O Notation (with notes)
- 3 Asymptotic Notations: Big O, Big Omega and Big Theta Explained (With Notes)
- 4 Best Case, Worst Case and Average Case Analysis of an Algorithm (With Notes)
- 5 How to Calculate Time Complexity of an Algorithm + Solved Questions (With Notes)
- 6 Arrays and Abstract Data Type in Data Structure (With Notes)
- 7 Array as An Abstract Data Type in Data Structures(With Notes)
- 8 Implementing Array as an Abstract Data Type in C Language
- 9 Operations on Arrays in Data Structures: Traversal, Insertion, Deletion and Searching
- 10 Coding Insertion Operation in Array in Data Structures in C language
- 11 Coding Deletion Operation in Array Using C Language (With Notes)
- 12 Linear Vs Binary Search + Code in C Language (With Notes)
- 13 Introduction to Linked List in Data Structures (With Notes)
- 14 Linked List Data Structure: Creation and Traversal in C Language
- 15 Insertion of a Node in a Linked List Data Structure
- 16 Insertion in a Linked List in C Language
- 17 Deletion in a Linked List | Deleting a node from Linked List Data Structure
- 18 Delete a Node from Linked List (C Code For Deletion From Beginning, End, Specified Position & Key)
- 19 Circular Linked List and Operations in Data Structures (With Notes)
- 20 Circular Linked Lists: Operations in C Language
- 21 Doubly Linked Lists Explained With Code in C Language
- 22 Introduction to Stack in Data Structures
- 23 Implementing Stack Using Array in Data Structures
- 24 C Code For Implementing Stack Using Array in Data Structures
- 25 Push, Pop and Other Operations in Stack Implemented Using an Array
- 26 Coding Push(), Pop(), isEmpty() and isFull() Operations in Stack Using an Array| C Code For Stack
- 27 Peek Operation in Stack Using Arrays (With C Code & Explanation)
- 28 stackTop, stackBottom & Time Complexity of Operations in Stack Using Arrays
- 29 How to Implement Stack Using Linked List?
- 30 Implementing all the Stack Operations using Linked List (With Code in C)
- 31 peek(), stackTop() and Other Operations on Stack Using Linked List (with C Code)
- 32 Parenthesis Matching Problem Using Stack Data Structure (Applications of Stack)
- 33 Parenthesis Checking Using Stack in C Language
- 34 Multiple Parenthesis Matching Using Stack with C Code
- 35 Infix, Prefix and Postfix Expressions
- 36 Infix To Postfix Using Stack
- 37 Coding Infix to Postfix in C using Stack
- 38 Queue Data Structure in Hindi
- 39 Queue Implementation: Array Implementation of Queue in Data Structure
- 40 Array implementation of Queue and its Operations in Data Structure
- 41 C Code For Queue and its Operations Using Arrays in Data Structure
- 42 Introduction to Circular Queue in Data Structures
- 43 enqueue(), dequeue() & other Operations on Circular Queue
- 44 C Code For Circular Queue & Operations on Circular Queue in Hindi
- 45 Queue Using Linked Lists
- 46 Implementing Queue Using Linked List in C Language (With Code)
- 47 Double-Ended Queue in Data Structure (DE-Queue Explained)🔥
- 48 Introduction to Sorting Algorithms
- 49 Criteria For Analysis of Sorting Algorithms
- 50 Bubble Sort Algorithm in Hindi
- 51 Bubble Sort Program in C
- 52 Insertion Sort Algorithm in Hindi
- 53 Insertion Sort in C Language (With Explanation)
- 54 Selection Sort Algorithm
- 55 Selection Sort Program in C
- 56 QuickSort Algorithm in Hindi (With Code in C)
- 57 Analysis of QuickSort Sorting Algorithm
- 58 MergeSort Sorting Algorithm in Hindi
- 59 MergeSort Source Code in C (Helpful Explanation)
- 60 Count Sort Algorithm
- 61 Introduction to Trees
- 62 What is a Binary Tree?
- 63 Types of Binary Trees
- 64 Representation of a Binary Tree
- 65 Linked Representation Of Binary Tree in C
- 66 Traversal in Binary Tree (InOrder, PostOrder and PreOrder Traversals)
- 67 Preorder Traversal in a Binary Tree (With C Code)
- 68 PostOrder Traversal in a Binary Tree (With C Code)
- 69 InOrder Traversal in a Binary Tree (With C Code)
- 70 *Best* Trick To Find PreOrder, InOrder & PostOrder Traversal
- 71 Binary Search Trees: Introduction & Properties
- 72 Checking if a binary tree is a binary search tree or not!
- 73 Searching in a Binary Search Trees (Search Operation)
- 74 C Code For Searching in a BST
- 75 Iterative Search in a Binary Search Tree
- 76 Insertion in a Binary Search Tree
- 77 Deletion in a Binary Search Tree
- 78 C Code For Deletion in a Binary Search Tree
- 79 AVL Trees - Introduction
- 80 Insertion and Rotation in AVL Tree
- 81 AVL Trees - LL LR RL and RR rotations
