Data Structures This is a Data Structures Full Course. Course Content Sorting and Searching Algorithms Selection Sort Working Mechanism Selection Sort Algorithm Bubble Sort Working Mechanism Bubble Sort Algorithm Optimized Bubble Sort Insertion Sort Working Mechanism Insertion Sort Algorithm Divide and Conquer Algorithm Design Technique Merge Sort Working Mechanism Merge Function in Merge Sort Algorithm Merge Sort Algorithm Quick Sort Working Mechanism Partition Algorithm in Quick Sort Quick Sort Algorithm Linear Search Algorithm Binary Search Algorithm Algorithm to find Maximum and Minimum number in an Array Working Mechanism for Finding the Maximum and Minimum using Divide and Conquer Technique Algorithm for Finding the Maximum and Minimum using Divide and Conquer Technique What is an Algorithm and How to Analyze an Algorithm Performance Analysis Space Complexity with an Example How to Analyze Time Complexity More Examples on Time Complexity Constructing Insertion Sort Algorithm With an Example Understanding Insertion Sort Performance Analysis and Program Selection Sort Logic Development Understanding Selection Sort Performance Analysis and Program Bubble Sort Logic Bubble Sort Performance Analysis and Program Understanding Merge Sort Example Merge Sort Logic Development Merge Sort Performace Analysis and Program Understanding Quick Sort Mechanism Quick Sort Logic Construction with an Example Understanding Quick Sort Performance Analysis and Program Radix Sort Mechanism understanding radix sort algorithm with an example Lesson 19 Program for Radix Sort Lesson 20 Linear Search Algorithm and Performance Analysis Lesson 21 Program for Linear Search Lesson 22 Binary Search Algorithm and Performance Analysis Lesson 23 Program for Binary Search Lesson 24 Introduction to Data Structures Lesson 25 Stack Data Structure Understanding Lesson 26 Algorithms for Stack Data Structure Oprations Lesson 27 Program for Stack Lesson 28 Infix to Postfix Conversion Lesson 29 Program for Infix to Postfix Conversion Lesson 30 Postfix Evaluation Understanding and Algorithm Lesson 31 Queue Data Structure and Algorithm Lesson 32 Program for Queue Data Structure Lesson 33 Cuircular Queue Working Mechanism and Algorithm Lesson 34 Program for Circular Queue Lesson 36.1 GATE BITS 1 On Stacks and Queus Lesson 36.2 GATE BITS 2 on Stacks and Queues Lesson 37 Introduction to Linked Lists Lesson 38 Single Linked List Insertion and Deletion at the Start Lesson 39 Program for Single Linked List Insertion and Deletion at the Start Lesson 40 Single Linked List Insertion and Deletion at the end Lesson 41 Algorithm for Single Linked List Insertion and Deletion at the End Lesson 42 Program for Single Linked List [Insertion and Deletion at the End Lesson 43 Understanding Single Linked List Insertion and Deletion in the Middle Lesson 44 Constructing Algorithm for Single Linked LIst [Inserion In the Middle] Lesson 45 Algorithm for Single Linked List to Delete a node in the Middle Lesson 46 Program for Single Linked List Insertion and Deletion in the Middle Lesson 47 Understanding Double Linked List Lesson 48 Understanding Circular Linked List Lesson 51 Introduction to Trees Lesson 52 Introduction to Binary Tree and Tree Traversal Lesson 53 More on Binary Tree and Traversals Lesson 54 Properties of Binary Tree 1 Lesson 55 Properties of Binary Tree 2 Lesson 56 Constructing Unique Tree Given Pre, In and Post Order Lesson 57 Introduction to Binary Search Tree Lesson 58 Operations on Binary Search Tree Lesson 59 Introduction to AVL Trees Lesson 60 AVL Tree Rotations Lesson 61 AVL Tree Operations Lesson 62 2 GATE Bits 2 on Trees Lesson 62 4 GATE Bits on Trees Lesson 68 Introduction to Graph Data Structure Lesson 69 Breadth First Search Lesson 70 Depth First Search Lesson 72 Introduction to Hashing Lesson 73 Chaining Collision Handling Technique Lesson 74 Open Addressing Collision Handling Technique Lesson 75 Linear Probing and Quadratic Probing in Hashing Lesson 76 Double Hashing Lesson 77.1 GATE Bits 1 on Hashing Lesson 77.2 GATE Bits 2 on Hashing