Course Content
Queue, Stack, Linked List
0/4
Introduction to Queue
03:20
Queue Types
05:55
Introduction to stack and its operations
02:42
Linked list types and operations (Deletion and Insertion)
03:37
Graph Theory
0/6
Introduction to Graph – Graph Types
05:50
Graph Representation
02:55
Spanning Tree and Minimum Spanning Tree
02:11
Kruskal’s Algorithm (Minimum Spanning Tree)
02:14
Prim’s Algorithm (Minimum Spanning Tree)
03:26
Depth First Search And Breadth First Search (Graph Traversal)
05:14
Trees
0/4
Introduction to Tree
02:50
Tree Traversal (Preorder-Inorder-Postorder)
06:48
Binary Tree
01:50
Binary Search Tree (BST) – Introduction and Operations
05:12
Heap Data Structure
0/4
Binary Search Tree (BST) – Introduction and Operations
03:10
Array Representation of Heap
04:02
Heap Creation (Top-down and Bottom-up)
01:12
Heap Deletion and Insertion
02:19
Searching Algorithms
0/4
Binary Search Introduction
03:10
Binary Search Implementation
04:02
Linear Search Introduction
01:12
Linear Search Implementation
02:19
Sorting Algorithms
0/12
Merege Sort – Part One (Introduction, Example, Implementation)
06:17
Merge Sort – Part Two (Example, Implementation)
04:57
Quick Sort (Introduction, Example, Implementation)
15:53
Heap Sort (Introduction, Example, Implementation)
14:03
Bubble Sort (Introduction, Example, Implementation)
09:05
Selection Sort (Introduction, Example, Implementation)
08:31
Insertion Sort (Introduction, Example, Implementation)
06:46
Counting Sort Introduction
07:20
Counting Sort (Example, Implementation)
04:37
Radix Sort Introduction
02:32
Radix Sort (Example, Implementation)
10:13
Bucket Sort (Introduction, Example, Implementation)
07:17
Data Structures & Algorithms
Previous
Next
0% Complete