Data Structures (English) (Part 2)

   Friday, April 26, 2024   

Starting a new Lecture Notes Series on Data Structures

Youtube Lecture Playlist Credits 

Channel Name: Neso Academy

So Let Us Start to This Journey of Learning 

Data Structures By Lecture Notes together!

Lecture 73: Doubly Linked List (Deleting the Intermediate Node)

Lecture 74: Reversing the Doubly Linked List

Lecture 75: Doubly Linked List (Solved Problem 1)

Lecture 76: Doubly Linked List (Solved Problem 2)

Lecture 77: Why Doubly Linked List?

Lecture 78: Rapid Fire Quiz (Doubly Linked List)

Lecture 79: Introduction to Circular Linked List

Lecture 80: Circular Singly Linked List (Insertion at the Beginning)

Lecture 81: Traversing a Circular Singly Linked List

Lecture 82: Circular Singly Linked List (Insertion at the End)

Lecture 83: Circular Singly Linked List (Insertion between the Nodes)

Lecture 84: Creating a Circular Singly Linked List

Lecture 85: Circular Singly Linked List (Deleting the First Node)

Lecture 86: Circular Singly Linked List (Deleting the Last Node)

Lecture 87: Circular Singly Linked List (Deleting the Intermediate Node)

Lecture 88: Circular Singly Linked List (Counting the Number of Elements)

Lecture 89: Circular Singly Linked List (Searching an Element)

Lecture 90: Circular Doubly Linked List (Insertion at the Beginning)

Lecture 91: Circular Doubly Linked List (Insertion at the End)

Lecture 92: Circular Doubly Linked List (Insertion between the Nodes)

Lecture 93: Circular Doubly Linked List (Deleting the First Node)

Lecture 94: Circular Doubly Linked List (Deleting the Last Node)

Lecture 95: Circular Doubly Linked List (Deleting the Intermediate Node)

Lecture 96: Sorted Singly Linked List (Inserting a New Element)

Lecture 97: Application of Linked List (Polynomial Arithmetic) - Part 1

Lecture 98: Application of Linked List (Polynomial Arithmetic) - Part 2

Lecture 99: Application of Linked List (Addition of Two Polynomials)

Lecture 100: Application of Linked List (Multiplication of Two Polynomials)

Lecture 101: Application of Linked List (Multiplication of Two Polynomials) - Improvements

Lecture 102: Adding Two Numbers using Linked Lists - Part 1

Lecture 103: Adding Two Numbers using Linked Lists - Part 2

Lecture 104: Adding Two Numbers using Linked Lists - Part 3

Lecture 105: Introduction to Stacks

Lecture 106: Array Implementation of Stacks (Part 1)

Lecture 107: Array Implementation of Stacks (Part 2)

Lecture 108: Array Implementation of Stacks (Part 3)

Lecture 109: Array Implementation of Stacks (Part 4)

Lecture 110: Stacks (Important Questions) – Set 1

Lecture 111: Stacks (Important Questions) – Set 2

Lecture 112: Stacks (Program 1) – Part 1

Lecture 113: Stacks (Program 1) – Part 2

Lecture 114: Stacks (Program 1) – Part 3

Lecture 115: Stacks (Program 2) – Part 1

Lecture 116: Stacks (Program 2) – Part 2

Lecture 117: Stacks (Program 3)

Lecture 118: Linked List Implementation of Stacks (Part 1)

Lecture 119: Linked List Implementation of Stacks (Part 2)

Lecture 120: Linked List Implementation of Stacks (Part 3)

Lecture 121: Stacks (Program 4) – Part 1

Lecture 122: Stacks (Program 4) – Part 2

Lecture 123: Stacks (Program 4) – Part 3

Lecture 124: Stacks (Program 4) – Part 4

Lecture 125: Stacks (Program 4) – Part 5

Lecture 126: Stacks (Program 4) – Part 6

Lecture 127: Stacks (Program 4) – Part 7

Lecture 128: Stacks (Program 5)

Lecture 129: Application of Stacks (Nested Brackets) - Part 1

Lecture 130: Application of Stacks (Nested Brackets) - Part 2

Lecture 131: Application of Stacks (Infix to Postfix) - Part 1

Lecture 132: Application of Stacks (Infix to Postfix) - Part 2

Lecture 133: Application of Stacks (Infix to Postfix) - Part 3

Lecture 134: Application of Stacks (Infix to Postfix) - Part 4

Lecture 135: Application of Stacks (Infix to Postfix) - Part 5

Lecture 136: Application of Stacks (Infix to Postfix) - Part 6

Lecture 137: Application of Stacks (Infix to Postfix) - Part 7

Lecture 138: Application of Stacks (Infix to Postfix) - Part 8

Lecture 139: Stacks (GATE Problems) - Set 1

Lecture 140: Stacks (GATE Problems) - Set 2

Lecture 141: Queues | Chapter-7 | Data Structures | nesoacademy.org

Lecture 142: Binary Trees | Chapter-8 | Data Structures | nesoacademy.org

Lecture 143: Binary Search Trees | Chapter-9 | Data Structures | nesoacademy.org

Lecture 144: AVL Trees | Chapter-10 | Data Structures | nesoacademy.org