# Author: Vivek Kumar

## Priority Queue – Introduction, Explanation and Implementation

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

## Queue – Introduction, Explanation and Implementation

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

## Stack – Introduction, Explanation and Implementation

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

## Doubly Linked List – Explanation and Implementation

A doubly linked list is an advanced form of linked list which has the ability to traverse back and forth i.e. in both the direction. It possesses an

## Circular Linked List – Explanation and Implementation

In a circular linked list all nodes are connected in a continuous cycle. Each node has two part Data and Next as a singly linked list has. The

## Linked List Types – Explanation

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,

## Linked List reversal – Implementation and 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

## Deletion from Linked List – Explanation, Types and Implementation

In our previous post we have discussed about Linked lists and how to insert a node in a linked list(at the front, at the end and somewhere in