Data Structure (Hindi) (Part 2)

   Sunday, May 05, 2024   

Starting a new Lecture Notes Series on Data Structure

Youtube Lecture Playlist Credits 

Channel Name: THE GATEHUB

So Let Us Start to This Journey of Learning 

Data Structure By Lecture Notes together!

Lecture 49: Evaluation of Infix, Prefix and Postfix expressions | Data structures

Lecture 50: infix to postfix conversion | infix to prefix conversion | without stack | Data Structure

Lecture 51: Infix to Postfix Conversion using Stack (Example 1) | Data Structure

Lecture 52: Infix to Postfix Conversion using Stack (Example 2) | Data Structure

Lecture 53: Evaluation of Postfix Expression using Stack | Data Structure

Lecture 54: Infix to Prefix Conversion using Stack | Data Structure

Lecture 55: Evaluation of Prefix Expression using Stack | Data Structure

Lecture 56: Important Question on Infix, Prefix and Postfix Expression | Data Structure

Lecture 57: Introduction to Queue | Application of Queue | Data Structure

Lecture 58: Queue Implementation using Array | Full explanation | Data Structure

Lecture 59: Queue implementation using linked list | Full explanation | Data Structure

Lecture 60: Circular queue in data structure | circular queue implementation using array | data structures

Lecture 61: Circular queue in data structure | Circular queue using linked list | data structures

Lecture 62: Introduction to Non Linear Data Structure | Tree and Graph | Data Structure

Lecture 63: Tree terminology | Tree in data structure | Introduction to trees | Data structures

Lecture 64: Binary Tree (Introduction) | Min and Max nodes at height h | Data Structure

Lecture 65: Types of Binary Tree | Full BT | Complete Binary Tree | Almost Complete Binary Tree | Data Structure

Lecture 66: Binary Tree Representation | Array representation of binary tree | Data Structure

Lecture 67: Binary Tree Representation | Linked Representation Of Binary Tree | Data Structure

Lecture 68: Binary Tree Traversals Example 1 [Shortcut] (Preorder, Inorder and Postorder) | Data structures

Lecture 69: Construct binary tree from preorder, postorder and inorder traversal | Data Structure

Lecture 70: Construct Binary Tree from Preorder and Inorder traversal | Data Structure

Lecture 71: Construct Binary Tree from Postorder and Inorder traversal | Data Structure

Lecture 72: Construct Binary Tree from Preorder, Postorder and Inorder traversal | Data Structure

Lecture 73: Binary Search Tree Definition | Insert Operation | BST | Data Structure

Lecture 74: Binary Search Trees Deletion Examples | Deleting a node from BST | Data Structure

Lecture 75: Construct Binary Search Tree from Postorder | BST Construction | Data structures

Lecture 76: Construct Binary Search Tree from Preorder | BST Construction | Data structures

Lecture 77: Number of BST's with N Nodes | Count Number of BST"s with N Nodes | Data Structure

Lecture 78: Introduction to AVL Tree | Rotations(LL, RR, LR, RL) with example | Data Structure

Lecture 79: AVL Tree Insertion and Rotation | AVL Tree Construction | Data Structure

Lecture 80: AVL Tree Deletion | AVL tree deletion example with all cases | Deletion in AVL Tree | Data structure

Lecture 81: Introduction to Red Black Tree | Properties of Red Black trees | RB Tree | Data structure

Lecture 82: Red Black Tree Insertion | RB Tree Insertion Algorithm | Data Structure

Lecture 83: Introduction to Graphs | Data Structure | Graph Terminology | Types of Graphs

Lecture 84: Graph representation using Adjacency Matrix and Adjacency List | Data Structure

Lecture 85: Breadth First Search (BFS) With Time Complexity| Graph Traversal | GATECSE | Data Structure

Lecture 86: Depth First Search (DFS) With Time Complexity| Graph Traversal | GATECSE | Data Structure

Lecture 87: DFS and BFS Solved Examples | GATECSE | Data Structure

Lecture 88: Topological Sort | Applications of Graph Traversal | GATECSE | Data Structure

Lecture 89: What is Hashing | Need of Hashing | Direct Address Table | Data Structure

Lecture 90: Hash function in hashing | Types of Hash Function | Hashing | Data Structures

Lecture 91: Chaining in hashing | open addressing | collision resolution techniques | Data Structure

Lecture 92: Linear Probing in Hashing | | Open Addressing | Collision Resolution Techniques | Data Structure

Lecture 93: Quadratic Probing in Hashing || Open Addressing | Collision Resolution Techniques | Data Structure

Lecture 94: Double Hashing in Hashing || Open Addressing | Collision Resolution Techniques | Data Structure

Lecture 95: Hashing Solved Examples | Hashing | GATECSE | Data Structure