Data structures
5.0
(0)
9 learners
What you'll learn
This course includes
- 9.5 hours of video
- Certificate of completion
- Access on mobile and TV
Course content
1 modules • 42 lessons • 9.5 hours of video
Data structures
42 lessons
• 9.5 hours
Data structures
42 lessons
• 9.5 hours
- Introduction to data structures 06:33
- Data Structures: List as abstract data type 13:08
- Introduction to linked list 17:13
- Data Structures: Arrays vs Linked Lists 12:16
- Linked List - Implementation in C/C++ 13:58
- Linked List in C/C++ - Inserting a node at beginning 12:50
- Linked List in C/C++ - Insert a node at nth position 15:15
- Linked List in C/C++ - Delete a node at nth position 12:30
- Reverse a linked list - Iterative method 13:50
- Print elements of a linked list in forward and reverse order using recursion 14:24
- Reverse a linked list using recursion 08:55
- Data structures: Introduction to Doubly Linked List 07:13
- Doubly Linked List - Implementation in C/C++ 15:21
- Data structures: Introduction to stack 08:26
- Data structures: Array implementation of stacks 13:09
- Data Structures: Linked List implementation of stacks 10:58
- Reverse a string or linked list using stack. 16:25
- Check for balanced parentheses using stack 14:13
- Infix, Prefix and Postfix 13:38
- Evaluation of Prefix and Postfix expressions using stack 14:10
- Infix to Postfix using stack 18:20
- Data structures: Introduction to Queues 09:19
- Data structures: Array implementation of Queue 14:59
- Data structures: Linked List implementation of Queue 14:17
- Data structures: Introduction to Trees 15:50
- Data structures: Binary Tree 16:17
- Data structures: Binary Search Tree 19:28
- Binary search tree - Implementation in C/C++ 18:36
- BST implementation - memory allocation in stack and heap 13:04
- Find min and max element in a binary search tree 05:48
- Find height of a binary tree 07:09
- Binary tree traversal - breadth-first and depth-first strategies 11:54
- Binary tree: Level Order Traversal 11:23
- Binary tree traversal: Preorder, Inorder, Postorder 14:29
- Check if a binary tree is binary search tree or not 16:30
- Delete a node from Binary Search Tree 18:27
- Inorder Successor in a binary search tree 17:58
- Data structures: Introduction to graphs 16:43
- Data structures: Properties of Graphs 15:16
- Graph Representation part 01 - Edge List 13:45
- Graph Representation part 02 - Adjacency Matrix 14:45
- Graph Representation part 03 - Adjacency List 27:50
Take this course with you
Download the app to continue lessons from your phone anytime.
