A tree is a hierarchical data structure, unlike array and linked list(which are known as a linear data structure). Saying hierarchy means nodes(or vertices) are ordered in top

Priority Queue is a data structure which is similar to Queue and Stack. Moreover, it is an extension to queue with following properties Each item is associated with

A queue is a data structure used to store items that has defined way of Insertion and Deletion operation. It follows First in First Out(FIFO) means items inserted

A stack is a data structure used to store items that has defined way of Insertion and Deletion operation. It follows Last in First Out(LIFO) means items inserted

Shell Sort is a generalized version of insertion sort. It is an in–place comparison sort. Shell Sort is also known as diminishing increment sort, it is one of

In earlier posts of linked lists, we have discussed about Linked list and some of its basic operations like Insertion and Deletion. Insertion – Insertion to Linked List – Explanation,