Course Content
Introduction
-
Linear Search
15:09 -
Binary Search
23:30 -
Asymptotic Notations
14:25
Stacks and Queues
-
Introduction to Stacks
17:40 -
Infix , Prefix and Postfix expressions
14:14 -
Infix to Postfix conversion using stack
12:33 -
Infix to Prefix conversion using stack
24:05 -
Evaluation of prefix and postfix expression using stack
21:03 -
Introduction to Queue
20:19 -
Implementation of Queue
19:47 -
Circular Queue in data structure
28:56 -
Introduction to Deque
12:46
Linked Lists
A linked list is a fundamental data structure in computer science. It consists of nodes where each node contains data and a reference (link) to the next node in the sequence. This allows for dynamic memory allocation and efficient insertion and deletion operations compared to arrays.
-
introduction to linked list
22:11 -
Linked list – creation and display
29:00 -
Insertion of a node in linked list
27:07 -
Deletion of a node in linked list
25:54 -
Introduction to doubly linked list
08:55 -
Insertion of a node in doubly linked list
35:15 -
Deletion of a node in doubly linked list
22:05 -
Introduction to Circular linked list
21:30 -
Insertion in Circular linked list
19:45 -
Deletion in circular linked list
23:58
Hashing and Sorting
-
Hashing Techniques
25:51 -
Hashing – Quadratic Probing
15:58 -
Double Hashing
26:52 -
Insertion Sort
28:13 -
Selection Sort
17:50 -
Bubble Sort
35:36 -
Quick Sort
24:43 -
Merge Sort
35:28 -
Heap sort
46:03
Trees
-
Introduction to Trees
29:17 -
Types of Binary Tree
24:11 -
Binary tree Traversal
11:08 -
Construct Binary tree from Preorder and Inorder traversal
09:45 -
Construct Binary tree from Postorder and Inorder traversal
07:34 -
Construct Binary tree from Preorder and Postorder traversal
19:00 -
Binary search tree (BST)
16:41 -
Construct Binary search tree from Preorder traversal
08:58 -
Construct Binary search tree from Postorder traversal
11:27 -
AVL Tree
24:30 -
Introduction to B-Tree
09:43 -
B+Tree
18:58
Graphs
-
Graph Representation in data structure
12:12 -
BFS and DFS Graph Traversal
20:27 -
Types of Edges in DFS
25:53
Student Ratings & Reviews
No Review Yet