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

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,

Reversing a linked list is one of the most commonly asked data structure interview questions. Shown the linked list 10, 20, 30. After reversed operation, it should be

Insertion to linked list can be done in three ways: Inserting a node at the front of linked list. Inserting a node at the end of linked list. Inserting a

Linked list is a linear data structure, linear refers to storing the elements sequentially in the form of nodes. Unlike arrays, here each element is linked using pointers