Basics of algorithm↵
===================↵
1. [What is an Algorithm explanation with an example](https://www.programmingoneonone.com/2020/02/algorithm-explanation.html)↵
1. [What is Data Structures and algorithms](https://www.programmingoneonone.com/2020/04/what-is-data-structures-algorithms.html)↵
1. [How to calculate running time of an algorithm](https://www.programmingoneonone.com/2020/05/how-to-calculate-running-time-of-algorithm.html)↵
1. [Worst, Everage and Best-case analysis of algorithm](https://www.programmingoneonone.com/2020/05/worst-everage-and-best-case-analysis-of-algorithm.html)↵
1. [Big o notation](https://www.programmingoneonone.com/2020/05/big-o-notation-in-data-structures.html)↵
1. [Big o notation examples](https://www.programmingoneonone.com/2020/05/big-o-notation-examples.html)↵
↵
Linked list and it's types↵
===========↵
↵
1. [Linked list in data structures](https://www.programmingoneonone.com/2020/05/linked-list-in-data-structures.html)↵
1. [Traversing in linked list](https://www.programmingoneonone.com/2020/05/traversing-in-linked-list.html)↵
1. [Operations on the linked list](https://www.programmingoneonone.com/2020/05/operations-on-linked-list.html)↵
1. [Insertion in linked list](https://www.programmingoneonone.com/2020/05/insertion-in-linked-list.html)↵
1. [Deletion in a linked list](https://www.programmingoneonone.com/2020/05/deletion-in-linked-list.html)↵
1. [Reversing a linked list](https://www.programmingoneonone.com/2020/05/reversing-linked-list.html)↵
1. [Sorting a linked list](https://www.programmingoneonone.com/2020/05/sorting-linked-list.html)↵
1. [Find and remove loop in linked list](https://www.programmingoneonone.com/2020/05/find-and-remove-loop-in-linked-list.html)↵
↵
Doubly linked list↵
------------------↵
1. [Doubly linked list](https://www.programmingoneonone.com/2020/05/doubly-linked-list.html)↵
1. [Insertion in the doubly linked list](https://www.programmingoneonone.com/2020/05/insertion-doubly-linked-list.html)↵
1. [Deletion in the doubly linked list](https://www.programmingoneonone.com/2020/05/deletion-doubly-linked-list.html)↵
1. [Reversing a doubly-linked list](https://www.programmingoneonone.com/2020/05/reversing-doubly-linked-list.html)↵
↵
Circular linked list↵
--------------------↵
1. [Circular linked list](https://www.programmingoneonone.com/2020/05/circular-linked-list.html)↵
1. [Insertion in circular linked list](https://www.programmingoneonone.com/2020/05/circular-linked-list-insertion.html)↵
1. [Deletion in circular linked list](https://www.programmingoneonone.com/2020/05/circular-linked-list-deletion.html)↵
↵
### Other types of linked list↵
1. [Merge two linked list](https://www.programmingoneonone.com/2020/05/merge-two-linked-list.html)↵
1. [Header linked list](https://www.programmingoneonone.com/2020/05/header-linked-list.html)↵
1. [Sorted linked list](https://www.programmingoneonone.com/2020/05/sorted-linked-list.html)↵
↵
↵
Stack↵
=====↵
1. [Stack in data structure](https://www.programmingoneonone.com/2020/05/stack-in-data-structures.html)↵
↵
Queue and it's types↵
--------------------↵
1. [Queue in data structures](https://www.programmingoneonone.com/2020/05/queue-in-data-structures.html)↵
1. [Circular queue](https://www.programmingoneonone.com/2020/05/circular-queue.html)↵
1. [Dequeue in the data structure](https://www.programmingoneonone.com/2020/05/data-structures-dequeue.html)↵
1. [Priority queue](https://www.programmingoneonone.com/2020/05/priority-queue.html)↵
↵
1. [Polish notation](https://www.programmingoneonone.com/2020/05/polish-notation.html)↵
↵
Tree↵
----↵
1. [Tree in the data structure](https://www.programmingoneonone.com/2020/05/data-structures-tree.html)↵
↵
↵
Binary tree↵
-----------↵
1. [Binary tree](https://www.programmingoneonone.com/2020/05/binary-tree.html)↵
1. [Array representation of binary tree](https://www.programmingoneonone.com/2020/05/binary-tree-array-representation.html)↵
1. [Linked representation of binary tree](https://www.programmingoneonone.com/2020/05/binary-tree-linked-representation.html)↵
1. [Traversing in binary tree](https://www.programmingoneonone.com/2020/06/binary-tree-traversing.html)↵
1. [Inorder traversal in binary tree](https://www.programmingoneonone.com/2020/06/inorder-traversal.html)↵
1. [Preorder traversal in binary tree](https://www.programmingoneonone.com/2020/06/preorder-traversal.html)↵
1. [Postorder traversal in binary tree](https://www.programmingoneonone.com/2020/06/binary-tree-postorder-traversal.html)↵
1. [Level order traversal in binary tree](https://www.programmingoneonone.com/2020/06/tree-level-order-traversing.html)↵
↵
Binary search tree↵
------------------↵
1. [Binary search tree](https://www.programmingoneonone.com/2020/06/binary-search-tree.html)↵
1. [Insertion in binary search tree](https://www.programmingoneonone.com/2020/06/binary-search-tree-insertion.html)↵
1. [Deletion in binary search tree](https://www.programmingoneonone.com/2020/06/binary-search-tree-deletion.html)↵
↵
Heap↵
----↵
[Heap in data structure](https://www.programmingoneonone.com/2020/06/data-structure-heap.html)↵
↵
Note: the links will be update and new links will be added time to time.
===================↵
1. [What is an Algorithm explanation with an example](https://www.programmingoneonone.com/2020/02/algorithm-explanation.html)↵
1. [What is Data Structures and algorithms](https://www.programmingoneonone.com/2020/04/what-is-data-structures-algorithms.html)↵
1. [How to calculate running time of an algorithm](https://www.programmingoneonone.com/2020/05/how-to-calculate-running-time-of-algorithm.html)↵
1. [Worst, Everage and Best-case analysis of algorithm](https://www.programmingoneonone.com/2020/05/worst-everage-and-best-case-analysis-of-algorithm.html)↵
1. [Big o notation](https://www.programmingoneonone.com/2020/05/big-o-notation-in-data-structures.html)↵
1. [Big o notation examples](https://www.programmingoneonone.com/2020/05/big-o-notation-examples.html)↵
↵
Linked list and it's types↵
===========↵
↵
1. [Linked list in data structures](https://www.programmingoneonone.com/2020/05/linked-list-in-data-structures.html)↵
1. [Traversing in linked list](https://www.programmingoneonone.com/2020/05/traversing-in-linked-list.html)↵
1. [Operations on the linked list](https://www.programmingoneonone.com/2020/05/operations-on-linked-list.html)↵
1. [Insertion in linked list](https://www.programmingoneonone.com/2020/05/insertion-in-linked-list.html)↵
1. [Deletion in a linked list](https://www.programmingoneonone.com/2020/05/deletion-in-linked-list.html)↵
1. [Reversing a linked list](https://www.programmingoneonone.com/2020/05/reversing-linked-list.html)↵
1. [Sorting a linked list](https://www.programmingoneonone.com/2020/05/sorting-linked-list.html)↵
1. [Find and remove loop in linked list](https://www.programmingoneonone.com/2020/05/find-and-remove-loop-in-linked-list.html)↵
↵
Doubly linked list↵
------------------↵
1. [Doubly linked list](https://www.programmingoneonone.com/2020/05/doubly-linked-list.html)↵
1. [Insertion in the doubly linked list](https://www.programmingoneonone.com/2020/05/insertion-doubly-linked-list.html)↵
1. [Deletion in the doubly linked list](https://www.programmingoneonone.com/2020/05/deletion-doubly-linked-list.html)↵
1. [Reversing a doubly-linked list](https://www.programmingoneonone.com/2020/05/reversing-doubly-linked-list.html)↵
↵
Circular linked list↵
--------------------↵
1. [Circular linked list](https://www.programmingoneonone.com/2020/05/circular-linked-list.html)↵
1. [Insertion in circular linked list](https://www.programmingoneonone.com/2020/05/circular-linked-list-insertion.html)↵
1. [Deletion in circular linked list](https://www.programmingoneonone.com/2020/05/circular-linked-list-deletion.html)↵
↵
### Other types of linked list↵
1. [Merge two linked list](https://www.programmingoneonone.com/2020/05/merge-two-linked-list.html)↵
1. [Header linked list](https://www.programmingoneonone.com/2020/05/header-linked-list.html)↵
1. [Sorted linked list](https://www.programmingoneonone.com/2020/05/sorted-linked-list.html)↵
↵
↵
Stack↵
=====↵
1. [Stack in data structure](https://www.programmingoneonone.com/2020/05/stack-in-data-structures.html)↵
↵
Queue and it's types↵
--------------------↵
1. [Queue in data structures](https://www.programmingoneonone.com/2020/05/queue-in-data-structures.html)↵
1. [Circular queue](https://www.programmingoneonone.com/2020/05/circular-queue.html)↵
1. [Dequeue in the data structure](https://www.programmingoneonone.com/2020/05/data-structures-dequeue.html)↵
1. [Priority queue](https://www.programmingoneonone.com/2020/05/priority-queue.html)↵
↵
1. [Polish notation](https://www.programmingoneonone.com/2020/05/polish-notation.html)↵
↵
Tree↵
----↵
1. [Tree in the data structure](https://www.programmingoneonone.com/2020/05/data-structures-tree.html)↵
↵
↵
Binary tree↵
-----------↵
1. [Binary tree](https://www.programmingoneonone.com/2020/05/binary-tree.html)↵
1. [Array representation of binary tree](https://www.programmingoneonone.com/2020/05/binary-tree-array-representation.html)↵
1. [Linked representation of binary tree](https://www.programmingoneonone.com/2020/05/binary-tree-linked-representation.html)↵
1. [Traversing in binary tree](https://www.programmingoneonone.com/2020/06/binary-tree-traversing.html)↵
1. [Inorder traversal in binary tree](https://www.programmingoneonone.com/2020/06/inorder-traversal.html)↵
1. [Preorder traversal in binary tree](https://www.programmingoneonone.com/2020/06/preorder-traversal.html)↵
1. [Postorder traversal in binary tree](https://www.programmingoneonone.com/2020/06/binary-tree-postorder-traversal.html)↵
1. [Level order traversal in binary tree](https://www.programmingoneonone.com/2020/06/tree-level-order-traversing.html)↵
↵
Binary search tree↵
------------------↵
1. [Binary search tree](https://www.programmingoneonone.com/2020/06/binary-search-tree.html)↵
1. [Insertion in binary search tree](https://www.programmingoneonone.com/2020/06/binary-search-tree-insertion.html)↵
1. [Deletion in binary search tree](https://www.programmingoneonone.com/2020/06/binary-search-tree-deletion.html)↵
↵
Heap↵
----↵
[Heap in data structure](https://www.programmingoneonone.com/2020/06/data-structure-heap.html)↵
↵
Note: the links will be update and new links will be added time to time.
