| 1 |
Introduction to data structures |
06:13 |
| 2 |
Data Structures: List as abstract data type |
13:14 |
| 3 |
Introduction to linked list |
17:12 |
| 4 |
Data Structures: Arrays vs Linked Lists |
12:15 |
| 5 |
Linked List - Implementation in C/C++ |
13:57 |
| 6 |
Linked List in C/C++ - Inserting a node at beginning |
12:49 |
| 7 |
Linked List in C/C++ - Insert a node at nth position |
15:14 |
| 8 |
Linked List in C/C++ - Delete a node at nth position |
12:29 |
| 9 |
Reverse a linked list - Iterative method |
13:49 |
| 10 |
Print elements of a linked list in forward and reverse order using recursion |
14:23 |
| 11 |
Reverse a linked list using recursionReverse a linked list using recursion |
08:54 |
| 12 |
Data structures: Introduction to Doubly Linked List |
07:12 |
| 13 |
Doubly Linked List - Implementation in C/C++ |
15:20 |
| 14 |
Data structures: Introduction to stack |
08:25 |
| 15 |
Data structures: Array implementation of stacks |
13:08 |
| 16 |
Data Structures: Linked List implementation of stacks |
10:57 |
| 17 |
Reverse a string or linked list using stack |
16:24 |
| 18 |
Check for balanced parentheses using stack |
14:12 |
| 19 |
Infix, Prefix and Postfix |
13:37 |
| 20 |
Evaluation of Prefix and Postfix expressions using stack |
14:09 |
| 21 |
Infix to Postfix using stack |
18:19 |
| 22 |
Data structures: Introduction to Queues |
09:18 |
| 23 |
Data structures: Array implementation of Queue |
14:58 |
| 24 |
Data structures: Linked List implementation of Queue |
14:16 |
| 25 |
Data structures: Introduction to Trees |
15:25 |
| 26 |
Data structures: Binary Tree |
16:16 |
| 27 |
Data structures: Binary Search Tree |
19:27 |
| 28 |
Binary search tree - Implementation in C/C++ |
18:35 |
| 29 |
BST implementation - memory allocation in stack and heap |
13:04 |
| 30 |
Find min and max element in a binary search tree |
5:47 |
| 31 |
Find height of a binary tree |
07:08 |
| 32 |
Binary tree traversal - breadth-first and depth-first strategies |
11:53 |
| 33 |
Binary tree: Level Order Traversal |
11:22 |
| 34 |
Binary tree traversal: Preorder, Inorder, Postorder |
14:29 |
| 35 |
Check if a binary tree is binary search tree or not |
16:30 |
| 36 |
Delete a node from Binary Search Tree |
18:27 |
| 37 |
Inorder Successor in a binary search tree |
17:58 |
| 38 |
Data structures: Introduction to graphs |
16:42 |
| 39 |
Data structures: Properties of Graphs |
15:16 |
| 40 |
Graph Representation part 01 - Edge List |
13:45 |
| 41 |
Graph Representation part 02 - Adjacency Matrix |
14:45 |
0 Questions:
Post a Comment