Basics of algorithm↵
===================↵
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↵
===========↵
↵
[Linked list in data structures](https://www.programmingoneonone.com/2020/05/linked-list-in-data-structures.html)↵
[Traversing in linked list](https://www.programmingoneonone.com/2020/05/traversing-in-linked-list.html)↵
[Operations on the linked list](https://www.programmingoneonone.com/2020/05/operations-on-linked-list.html)↵
[Insertion in linked list](https://www.programmingoneonone.com/2020/05/insertion-in-linked-list.html)↵
[Deletion in a linked list](https://www.programmingoneonone.com/2020/05/deletion-in-linked-list.html)↵
[Reversing a linked list](https://www.programmingoneonone.com/2020/05/reversing-linked-list.html)↵
[Sorting a linked list](https://www.programmingoneonone.com/2020/05/sorting-linked-list.html)↵
[Find and remove loop in linked list](https://www.programmingoneonone.com/2020/05/find-and-remove-loop-in-linked-list.html)↵
↵
Doubly linked list↵
------------------↵
[Doubly linked list](https://www.programmingoneonone.com/2020/05/doubly-linked-list.html)↵
[Insertion in the doubly linked list](https://www.programmingoneonone.com/2020/05/insertion-doubly-linked-list.html)↵
[Deletion in the doubly linked list](https://www.programmingoneonone.com/2020/05/deletion-doubly-linked-list.html)↵
[Reversing a doubly-linked list](https://www.programmingoneonone.com/2020/05/reversing-doubly-linked-list.html)↵
↵
Circular linked list↵
--------------------↵
[Circular linked list](https://www.programmingoneonone.com/2020/05/circular-linked-list.html)↵
[Insertion in circular linked list](https://www.programmingoneonone.com/2020/05/circular-linked-list-insertion.html)↵
[Deletion in circular linked list](https://www.programmingoneonone.com/2020/05/circular-linked-list-deletion.html)↵
↵
### Other types of linked list↵
[Merge two linked list](https://www.programmingoneonone.com/2020/05/merge-two-linked-list.html)↵
[Header linked list](https://www.programmingoneonone.com/2020/05/header-linked-list.html)↵
[Sorted linked list](https://www.programmingoneonone.com/2020/05/sorted-linked-list.html)↵
↵
↵
Stack↵
=====↵
[Stack in data structure](https://www.programmingoneonone.com/2020/05/stack-in-data-structures.html)↵
↵
Queue and it's types↵
--------------------↵
[Queue in data structures](https://www.programmingoneonone.com/2020/05/queue-in-data-structures.html)↵
[Circular queue](https://www.programmingoneonone.com/2020/05/circular-queue.html)↵
[Dequeue in the data structure](https://www.programmingoneonone.com/2020/05/data-structures-dequeue.html)↵
[Priority queue](https://www.programmingoneonone.com/2020/05/priority-queue.html)↵
↵
[Polish notation](https://www.programmingoneonone.com/2020/05/polish-notation.html)↵
↵
Tree↵
----↵
[Tree in the data structure](https://www.programmingoneonone.com/2020/05/data-structures-tree.html)↵
↵
↵
Binary tree↵
-----------↵
[Binary tree](https://www.programmingoneonone.com/2020/05/binary-tree.html)↵
[Array representation of binary tree](https://www.programmingoneonone.com/2020/05/binary-tree-array-representation.html)↵
[Linked representation of binary tree](https://www.programmingoneonone.com/2020/05/binary-tree-linked-representation.html)↵
[Traversing in binary tree](https://www.programmingoneonone.com/2020/06/binary-tree-traversing.html)↵
[Inorder traversal in binary tree](https://www.programmingoneonone.com/2020/06/inorder-traversal.html)↵
[Preorder traversal in binary tree](https://www.programmingoneonone.com/2020/06/preorder-traversal.html)↵
[Postorder traversal in binary tree](https://www.programmingoneonone.com/2020/06/binary-tree-postorder-traversal.html)↵
[Level order traversal in binary tree](https://www.programmingoneonone.com/2020/06/tree-level-order-traversing.html)↵
↵
Binary search tree↵
------------------↵
[Binary search tree](https://www.programmingoneonone.com/2020/06/binary-search-tree.html)↵
[Insertion in binary search tree](https://www.programmingoneonone.com/2020/06/binary-search-tree-insertion.html)↵
[Deletion in binary search tree](https://www.programmingoneonone.com/2020/06/binary-search-tree-deletion.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↵
===========↵
↵
[Linked list in data structures](https://www.programmingoneonone.com/2020/05/linked-list-in-data-structures.html)↵
[Traversing in linked list](https://www.programmingoneonone.com/2020/05/traversing-in-linked-list.html)↵
[Operations on the linked list](https://www.programmingoneonone.com/2020/05/operations-on-linked-list.html)↵
[Insertion in linked list](https://www.programmingoneonone.com/2020/05/insertion-in-linked-list.html)↵
[Deletion in a linked list](https://www.programmingoneonone.com/2020/05/deletion-in-linked-list.html)↵
[Reversing a linked list](https://www.programmingoneonone.com/2020/05/reversing-linked-list.html)↵
[Sorting a linked list](https://www.programmingoneonone.com/2020/05/sorting-linked-list.html)↵
[Find and remove loop in linked list](https://www.programmingoneonone.com/2020/05/find-and-remove-loop-in-linked-list.html)↵
↵
Doubly linked list↵
------------------↵
[Doubly linked list](https://www.programmingoneonone.com/2020/05/doubly-linked-list.html)↵
[Insertion in the doubly linked list](https://www.programmingoneonone.com/2020/05/insertion-doubly-linked-list.html)↵
[Deletion in the doubly linked list](https://www.programmingoneonone.com/2020/05/deletion-doubly-linked-list.html)↵
[Reversing a doubly-linked list](https://www.programmingoneonone.com/2020/05/reversing-doubly-linked-list.html)↵
↵
Circular linked list↵
--------------------↵
[Circular linked list](https://www.programmingoneonone.com/2020/05/circular-linked-list.html)↵
[Insertion in circular linked list](https://www.programmingoneonone.com/2020/05/circular-linked-list-insertion.html)↵
[Deletion in circular linked list](https://www.programmingoneonone.com/2020/05/circular-linked-list-deletion.html)↵
↵
### Other types of linked list↵
[Merge two linked list](https://www.programmingoneonone.com/2020/05/merge-two-linked-list.html)↵
[Header linked list](https://www.programmingoneonone.com/2020/05/header-linked-list.html)↵
[Sorted linked list](https://www.programmingoneonone.com/2020/05/sorted-linked-list.html)↵
↵
↵
Stack↵
=====↵
[Stack in data structure](https://www.programmingoneonone.com/2020/05/stack-in-data-structures.html)↵
↵
Queue and it's types↵
--------------------↵
[Queue in data structures](https://www.programmingoneonone.com/2020/05/queue-in-data-structures.html)↵
[Circular queue](https://www.programmingoneonone.com/2020/05/circular-queue.html)↵
[Dequeue in the data structure](https://www.programmingoneonone.com/2020/05/data-structures-dequeue.html)↵
[Priority queue](https://www.programmingoneonone.com/2020/05/priority-queue.html)↵
↵
[Polish notation](https://www.programmingoneonone.com/2020/05/polish-notation.html)↵
↵
Tree↵
----↵
[Tree in the data structure](https://www.programmingoneonone.com/2020/05/data-structures-tree.html)↵
↵
↵
Binary tree↵
-----------↵
[Binary tree](https://www.programmingoneonone.com/2020/05/binary-tree.html)↵
[Array representation of binary tree](https://www.programmingoneonone.com/2020/05/binary-tree-array-representation.html)↵
[Linked representation of binary tree](https://www.programmingoneonone.com/2020/05/binary-tree-linked-representation.html)↵
[Traversing in binary tree](https://www.programmingoneonone.com/2020/06/binary-tree-traversing.html)↵
[Inorder traversal in binary tree](https://www.programmingoneonone.com/2020/06/inorder-traversal.html)↵
[Preorder traversal in binary tree](https://www.programmingoneonone.com/2020/06/preorder-traversal.html)↵
[Postorder traversal in binary tree](https://www.programmingoneonone.com/2020/06/binary-tree-postorder-traversal.html)↵
[Level order traversal in binary tree](https://www.programmingoneonone.com/2020/06/tree-level-order-traversing.html)↵
↵
Binary search tree↵
------------------↵
[Binary search tree](https://www.programmingoneonone.com/2020/06/binary-search-tree.html)↵
[Insertion in binary search tree](https://www.programmingoneonone.com/2020/06/binary-search-tree-insertion.html)↵
[Deletion in binary search tree](https://www.programmingoneonone.com/2020/06/binary-search-tree-deletion.html)↵
↵
↵
