About Course
Data structures (DS). A good algorithm usually comes together with a set of good (DS) that allow the algorithm to manipulate the data efficiently.
In this course, we consider the common (DS) that are used in various computational problems. You will learn how these (DS) are implemented in different programming languages and will practice implementing them in our programming assignments. This will help you to understand what is going on inside a particular built-in implementation of a data structure and what to expect from it. You will also learn typical use cases for these data structures.
Course Content
learn data structures
-
Graph Representation part 03 – Adjacency List
00:00 -
Find min and max element in a binary search tree
00:00 -
BST implementation – memory allocation in stack and heap
00:00 -
Binary search tree – Implementation in C/C++
00:00 -
Binary Search Tree
00:00 -
Binary Tree
00:00 -
Introduction to Trees
00:00 -
Linked List implementation of Queue
00:00 -
Array implementation of Queue
00:00 -
Find height of a binary tree
00:00 -
Binary tree traversal – breadth-first and depth-first strategies
00:00 -
Binary tree: Level Order Traversal
00:00 -
Graph Representation part 02 – Adjacency Matrix
00:00 -
Graph Representation part 01 – Edge List
00:00 -
Properties of Graphs
00:00 -
Introduction to graphs
00:00 -
Inorder Successor in a binary search tree
00:00 -
Delete a node from Binary Search Tree
00:00 -
Check if a binary tree is binary search tree or not
00:00 -
Binary tree traversal: Preorder, Inorder, Postorder
00:00 -
Introduction to Queues
00:00 -
Infix to Postfix using stack
00:00 -
Reverse a linked list – Iterative method
00:00 -
Linked List in C/C++ – Delete a node at nth position
00:00 -
Linked List in C/C++ – Insert a node at nth position
00:00 -
Linked List in C/C++ – Inserting a node at beginning
00:00 -
Linked List – Implementation in C/C++
00:00 -
Data Structures: Arrays vs Linked Lists
00:00 -
Introduction to linked list
00:00 -
Data Structures: List as abstract data type
00:00 -
Print elements of a linked list in forward and reverse order using recursion
00:00 -
Reverse a linked list using recursion
00:00 -
Doubly Linked List
00:00 -
Evaluation of Prefix and Postfix expressions using stack
00:00 -
Infix, Prefix and Postfix
00:00 -
Check for balanced parentheses using stack
00:00 -
Reverse a string or linked list using stack.
00:00 -
Linked List implementation of stacks
00:00 -
Array implementation of stacks
00:00 -
Introduction to stack
00:00 -
Doubly Linked List – Implementation in C/C++
00:00 -
Introduction to data structures
00:00
Student Ratings & Reviews
No Review Yet