Data Structures (English) (Part 2)

   Wednesday, September 30, 2020   

Starting a new Lecture Notes Series on Data Structures

Youtube Lecture Playlist Credits: 

Channel Name: Tutorials Point (India) Ltd.

So Let Us Start to This Journey of Learning 

Data Structures By Lecture Notes together!

Click Here!

 

Lecture Description of this above Topic:

Lecture 73: Implementing Four Stacks In One Array

Lecture 74: Stack Application Evaluation Of Post Fix Expression

Lecture 75: Stack Application Evaluation Of Post Fix Expression Example

Lecture 76: Stack Application Infix to Postfix Conversion

Lecture 77: Stack Application Infix To Postfix Conversion Example

Lecture 78: Stack GATE Exercise

Lecture 79: Queue Operations Introduction

Lecture 80: Queue Operations Insert

Lecture 81: Queue Operations Delete

Lecture 82: Priority Queue

Lecture 83: Binary Tree And Terminologies

Lecture 84: Binary Tree Representation In Memory

Lecture 85: Binary Tree Traversals

Lecture 86: Binary Tree Traversals GATE Exercise 1

Lecture 87: Binary Tree Traversals GATE Exercise 2

Lecture 88: Algorithm Of In-Order Traversal

Lecture 89: Algorithm Of Pre-Order Traversal

Lecture 90: Algorithm Of Post-Order Traversal

Lecture 91: Binary Search Tree Introduction

Lecture 92: Searching An Item In BST

Lecture 93: Insertion Of An Item In BST

Lecture 94: Deletion Of A Node From BST With One Or Zero Child Node

Lecture 95: Deletion of a Node from BST With Two Children

Lecture 96: Deleting A Node From BST

Lecture 97: Ranked Binary Search Tree

Lecture 98: Extended Binary Tree Or 2-Tree

Lecture 99: Huffman’s Algorithm With Example

Lecture 100: Huffman’s Coding

Lecture 101: Exercise On Huffman Code

Lecture 102: Binary Tree GATE Exercise

Lecture 103: Binary Search Tree GATE Exercise 1

Lecture 104: Binary Search Tree GATE Exercise 2

Lecture 105: AVL Tree - A Height Balanced Tree

Lecture 106: AVL Search Tree LL And RR Rotation

Lecture 107: AVL Search Tree RL And LR Rotation

Lecture 108: AVL Search Tree GATE Exercise

Lecture 109: B-Tree Definition And Properties

Lecture 110: B-Tree An Example

Lecture 111: Heap Tree

Lecture 112: Heap Tree Insertion Operation

Lecture 113: Heap Tree Insertion Operation Example

Lecture 114: Heap Tree Deletion Operation

Lecture 115: Heap Tree - Deletion Operation Example

Lecture 116: Heap Sort

Lecture 117: Exercise On Heap Sort

Lecture 118: Bubble Sort

Lecture 119: Modified Bubble Sort

Lecture 120: Insertion Sort

Lecture 121: Selection Sort

Lecture 122: Quick Sort

Lecture 123: Merge Sort

Lecture 124: Execution Tracing Of Merge Sort

Lecture 125: Radix Sort Example

Lecture 126: Radix Sort Algorithm

Lecture 127: Sorting GATE Exercise 1

Lecture 128: Sorting GATE Exercise 2

Lecture 129: External Sorting - Introduction

Lecture 130: External Sorting Sample Implementation

Lecture 131: Linear Search

Lecture 132: Linear Search On Sorted Array

Lecture 133: Binary Search

Lecture 134: Trie Structure Algorithm

Lecture 135: Trie Structure Example

Lecture 136: Hashing

Lecture 137: Hashing Collision and Collision Resolution

Lecture 138: Hashing Chaining

Lecture 139: Hashing Chaining Example

Lecture 140: Hashing With Example

Lecture 141: Hashing GATE Exercise