Advantages of Circular Queue over Linear Queue
Linear Queue It is a linear data structure that works on the principle of FIFO (First in First out) i.e. the element which is enqueued first will be dequeued first....
Merge two sorted arrays in Python using heapq
Heap Heap Data structure primarily focuses on representing priority queue. In Python, there is an inbuilt module “heapq” which is used for implementing Heap data structure. By default, Min Heap...
Merge two Binary Max-Heaps
Binary Max - Heap A binary max - heap follows two conditions: The given tree must be a complete binary tree (All levels are completely filled except the last level...
K-ary heap
K-ary heaps are similar to the binary heap (where K = 2) just having one difference that instead of 2 child nodes, there can be k child nodes for every...
Implement stack using Priority Queue or Heap
What is a priority queue? The priority queue is a type of queue data structure having one extra feature of giving priority to every element present in the priority queue....
Fibonacci Heap – Insertion and Union
Fibonacci Heap: Fibonacci heap is a data structure which collectionis a collection of trees having max heap or min-heap properties. These two properties are the characteristics of the fibonacci heap...
Circular Queue Set 1 Introduction Array Implementation
Circular queue: Circular queue is a linear data structure which follows the FIFO(First in first out) property. In this, the last element is connected to the first element to make...
Priority queue in C++ STL
Priority Queue: Priority queue is an abstract data type, It is a type of queue in which each element has a priority assigned to it. The priority of the element...
Priority Queue Introduction
Priority Queue: Priority queue is an abstract data type, It is a type of queue in which each element has a priority assigned to it. The priority of the element...
Priority Queue Using Linked List
Priority Queue: Priority queue is an abstract data type, It is a type of queue in which each element has a priority assigned to it. The priority of the element...
Queue Introduction and Array Implementation
Queue: A Queue is a linear data structure. Queue follows the FIFO rule i.e. First in First out. In other words we can say the element that goes in first...
Queue Using Stacks
Problem statement: Problem is straightforward, we have to implement a queue using stack. Queue: A Queue is a linear data structure. Queue follows the FIFO rule i.e. First in First...
Stl Priority Queue For Structure Or Class
Priority Queue: Priority queue is an abstract data type, It is a type of queue in which each element has a priority assigned to it. The priority of the element...
Queue C++ STL
Queue: 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...
Applications of Queue Data Structure
Queue A queue is basically a linear data structure that works on the principle of FIFO (First in First out) which means an element that is enqueued first will be...
Queue Linked List Implementation
Queue: A Queue is a linear data structure. Queue follows the FIFO rule i.e. First in First out. In other words we can say the element that goes in first...
Implementation Binomial Heap
In data structures, a binomial heap is similar to a binary heap that also supports the quick merging of two heaps. What is a Binomial Heap? A binomial heap is...
Implement Stack Using Queue
Problem statement: Given a queue we need to implement a stack data structure. Stack is a linear data structure in which a user can insert and delete an element from...
Difference between Linear Queue and Circular Queue
Linear Queue It is a linear data structure that works on the principle of FIFO (First in First out) i.e. the element which is enqueued first will be dequeued first....
Difference Between Array, Queue and Stack
Array: An Array is a collection of elements which are stored in a contiguous memory. The idea is simple i.e. to store the multiple elements together. Due to which we...
Queue Data Structure
Queue: A queue is basically a linear data structure that works on the principle of FIFO (First in First out) which means an element that is enqueued first will be...
Applications of Priority Queue
A Priority Queue is a special type of queue in which elements present in the queue are served according to their priority i.e. element with the higher priority will be...
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...
How are variables stored in python – Stack or Heap?
Memory allocation is the process of allocating memory to a computer program. In Python, the process of memory allocation and deallocation is handled automatically as there is a garbage collector...