If you are new in the programming world and want to learn Data Structures and Algorithms from basic to advanced topics with step by step explaination then you are in the right place.
all you need is to just follow these tutorials to learn Data Structures and algorithms.
Basic Algorithms
- How to calculate the running time of an algorithm.
- Worst Average and Best-case analysis of the algorithm.
- Big o notation
- Big o notation examples
Linked List
- Linked List in Data Structures
- Traversing in Linked list
- Operations on the linked list
- Insertion in the linked list
- Deletion in a linked list
- Reversing a linked list
- Sorting a linked list
- Find and remove loop in the linked list
Doubly Linked List
- Doubly linked list
- Insertion in the doubly linked list
- Deletion in the doubly linked list
- Reversing a doubly linked list
Circular Linked list
Other types of linked list
Stack
Queue
Tree
Binary Tree
- Binary tree
- Array representation of the binary tree
- linked representation of a binary tree
- Traversing in the binary tree
- Inorder traversal in the binary tree
- Preorder traversal in the binary tree
- Postorder traversal in the binary tree
- Level order traversal in the binary tree
Binary Search tree
Heap
More tutorials and links will be added from time to time. this approach is followed to prepare you for product-based and service-based companies.
0 Comments