Data Structure – Part 2

Course Curriculum

Chapter 1: Binary Search Tree

Lecture 1: Introduction

Lecture 2: Binary Search Tree Formation Visualization

Lecture 3: Binary Search Tree – Insert Operation Code – Part 1

Lecture 4: Binary Search Tree – Insert Operation Code – Part 2

Lecture 5: Binary Search Tree – Delete Operation Code – Case 1

Lecture 6: Binary Search Tree – Delete Operation Code – Case 2

Lecture 7: Binary Search Tree – Delete Operation – Case 3

Lecture 8: Code

Chapter 2: Tree Traversal

Lecture 1: Traversal Basics with Recursive Code Flow

Lecture 2: Inorder Traversal using Stack – Iterative Method – Concept

Lecture 3: Inorder Traversal using Stack – Code Implemnetation

Lecture 4: Threaded Binary Tree

Lecture 5: Morris Traversal Code Implementation

Lecture 6: Code

Chapter 3: AVL Tree

Lecture 1: AVL Tree – Introduction

Lecture 2: AVL Tree – How to apply Rotation

Lecture 3: AVL Tree – Create AVL tree with Sample data

Lecture 4: AVL Tree – Delete a node from AVL – Part 1

Lecture 5: AVL Tree – Delete node from AVL with different example – Part 2

Chapter 4: Uses of Binary Tree and Huffman Encoding

Lecture 1: Applications of Binary Tree and Huffman Encoding

Lecture 2: Restore Original Message using Huffman Encoding

Chapter 5: Heap

Lecture 1: Complete Binary Tree

Lecture 2: Heap Intro and Insertion Operation

Lecture 3: Heap – Delete Functionality

Lecture 4: Build Heap using Sample Data

Lecture 5: Create Heap Structure – Code Implementaion

Lecture 6: Delete a node from Heap – Code Implementaion

Lecture 7: Code

Chapter 6: Disjoint Set

Lecture 1: Disjoint Set Concept – Part 1

Lecture 2: Disjoint Set Concept – Part 2

Lecture 3: Disjoint Set – Path Compression

Lecture 4: Disjoint Set – Visualization

Lecture 5: Disjoint Set – Maze Generation Algorithm Step by Step

Lecture 6: Disjoint Set – Code Implementation Union / Find Method

Lecture 7: Disjoint Set – Code Implementation Path Compression

Lecture 8: Disjoint Set – Code