قائمة الدروس
- Introduction to data structures
- Data Structures: List as abstract data type
- Introduction to linked list
- Data Structures: Arrays vs Linked Lists
- Linked List - Implementation in C/C++
- Linked List in C/C++ - Inserting a node at beginning
- Linked List in C/C++ - Insert a node at nth position
- Linked List in C/C++ - Delete a node at nth position
- Reverse a linked list - Iterative method
- Print elements of a linked list in forward and reverse order using recursion
- Reverse a linked list using recursion
- Data structures: Introduction to Doubly Linked List
- Doubly Linked List - Implementation in C/C++
- Data structures: Introduction to stack
- Data structures: Array implementation of stacks
- Data Structures: Linked List implementation of stacks
- Reverse a string or linked list using stack.
- Check for balanced parentheses using stack
- Infix, Prefix and Postfix
- Evaluation of Prefix and Postfix expressions using stack
- Infix to Postfix using stack
- Data structures: Introduction to Queues
- Data structures: Array implementation of Queue
- Data structures: Linked List implementation of Queue
- Data structures: Introduction to Trees
- Data structures: Binary Tree
- Data structures: Binary Search Tree
- Binary search tree - Implementation in C/C++
- BST implementation - memory allocation in stack and heap
- Find min and max element in a binary search tree
- Find height of a binary tree
- Binary tree traversal - breadth-first and depth-first strategies
- Binary tree: Level Order Traversal
- Binary tree traversal: Preorder, Inorder, Postorder
- Check if a binary tree is binary search tree or not
- Delete a node from Binary Search Tree
- Inorder Successor in a binary search tree
- Data structures: Introduction to graphs
- Data structures: Properties of Graphs
- Graph Representation part 01 - Edge List
- Graph Representation part 02 - Adjacency Matrix
- Graph Representation part 03 - Adjacency List
Loading...
