Introduction to Linked Lists Linked List is a very commonly used linear data structure which consists of group of nodes in a sequence. Each node holds its own data and the address of the next node hence forming a chain like structure. Linked Lists are used to create trees and graphs. Advantages of Linked Lists […]

# Implement Queue using Stacks

Implement Queue using Stacks A Queue is defined by its property of FIFO, which means First in First Out, i.e the element which is added first is taken out first. This behaviour defines a queue, whereas data is actually stored in an array or a list in the background. What we mean here is that […]

# What is a Circular Queue?

What is a Circular Queue? Before we start to learn about Circular queue, we should first understand, why we need a circular queue, when we already have linear queue data structure. In a Linear queue, once the queue is completely full, it’s not possible to insert more elements. Even if we dequeue the queue to […]

# What is a Queue Data Structure?

What is a Queue Data Structure? Queue is also an abstract data type or a linear data structure, just like stack data structure, in which the first element is inserted from one end called the REAR(also called tail), and the removal of existing element takes place from the other end called as FRONT(also called head). […]

# What is Stack Data Structure?

What is Stack Data Structure? Stack is an abstract data type with a bounded(predefined) capacity. It is a simple data structure that allows adding and removing elements in a particular order. Every time an element is added, it goes on the top of the stack and the only element that can be removed is the […]