Basics of algorithm

1. How to calculate running time of an algorithm
2. Worst, Everage and Best-case analysis of algorithm
3. Big o notation
4. Big o notation examples

Linked list and it's types

1. Linked list in data structures
2. Traversing in linked list
3. Operations on the linked list
4. Insertion in linked list
5. Deletion in a linked list
6. Reversing a linked list
7. Sorting a linked list
8. Find and remove loop in linked list

Doubly linked list

1. Doubly linked list
2. Insertion in the doubly linked list
3. Deletion in the doubly linked list
4. Reversing a doubly-linked list

Circular linked list

1. Circular linked list
2. Insertion in circular linked list
3. Deletion in circular linked list

Other types of linked list

1. Merge two linked list
2. Header linked list
3. Sorted linked list

Stack

1. Stack in data structure

Queue and it's types

1. Queue in data structures
2. Circular queue
3. Dequeue in the data structure
4. Priority queue

5. Polish notation

Tree

1. Tree in the data structure

Binary tree

1. Binary tree
2. Array representation of binary tree
3. Linked representation of binary tree
4. Traversing in binary tree
5. Inorder traversal in binary tree
6. Preorder traversal in binary tree
7. Postorder traversal in binary tree
8. Level order traversal in binary tree

Binary search tree

1. Binary search tree
2. Insertion in binary search tree
3. Deletion in binary search tree

Heap Heap in data structure

Note: the links will be update and new links will be added time to time.