Contents
- 1 Data Structure Online Training Overview
- 1.1 Introduction to Dynamic Memory Allocation
- 1.2 Introduction to Data Structures
- 1.3 Stacks
- 1.4 Queues
- 1.5 Introduction to linked lists
- 1.6 Single linked list
- 1.7 Double linked list
- 1.8 Circular linked list
- 1.9 Notations
- 1.10 Introduction to Trees
- 1.11 Binary Trees
- 1.12 Binary search Trees
- 1.13 In-order, pre-order, post-order traversal of BST
- 1.14 Introduction to Graphs
- 1.15 Implementation of BFS and DFS
- 1.16 Searching Algorithms
- 1.17 Sorting Algorithms
- 1.18 Introduction to AVL Trees
- 1.19 Introduction to Red-Black Trees
Duration of the Course
- 30 Hrs
Data Structure Online Training Overview
-
Introduction to Dynamic Memory Allocation
-
Introduction to Data Structures
-
Stacks
-
Queues
-
Introduction to linked lists
-
Single linked list
-
Double linked list
-
Circular linked list
-
Notations
-
Introduction to Trees
-
Binary Trees
-
Binary search Trees
-
In-order, pre-order, post-order traversal of BST
-
Introduction to Graphs
-
Implementation of BFS and DFS
-
Searching Algorithms
-
Sorting Algorithms
-
Introduction to AVL Trees
-
Introduction to Red-Black Trees
