## Difference between Stack and Queue Data Structures

What is stack data structure? Stack is a linear data structure in which a user can insert and delete an element from the same end which is known as a...

## Python Queue using Doubly Linked List

What is a Queue? A queue is a linear data structure that works on the principle of FIFO(First in First out) i.e. the element which is inserted first will be...

## Python Program for Heap Sort

Problem Statement: Given an array, we have to sort it using heap sort. Heap Sort is a sorting algorithm based on the binary heap data structure in which first we...

## Queues in Python

The queue is a linear data structure that works on the principle of First in First out (FIFO). In the queue, the element which is added at least recently is...

## Check if a given Binary Tree is Heap

Problem Statement: Given a binary tree, our task is to check whether the given tree follows the max heap property or not. What is a Binary Tree? Binary tree is...

## Priority Queue in Python

Priority Queue Priority queues are abstract data structures where each element in the queue has a priority value. For example, in any airline, baggage under the “First-Class” or “Business” arrives...

## Stack and Queues in python

In data structures, stack and queue are part of linear data structure. Stack Stack follows the principle of LIFO (Last in First out) i.e. element which is inserted at last...