Stack, Queue in Python using Module queue
In python, it is quite easy to implement stack and queue data structures. Stack works on the principle of LIFO (Last in First out) i.e. element which is inserted in...
Priority Queue using Array in C
Priority queues are fundamental data structures that play a crucial role in various computer science applications, from operating systems to graph algorithms and event-driven simulations. They provide efficient access to...
Advantages of Circular Queue over Linear Queue
The circular queue has several advantages over linear queue. It uses memory more efficiently because it can reuse the space that becomes available when elements are dequeued. The circular queue...
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....
Implementing Queue using Stacks
In this tutorial, we will talk about a famous data structure problem “implement queue using stack”. Firstly, we will understand what stack and queue in data structure, then we will...
Applications of Queue in Data Structure
Queues are essential in the data structure, used to manage collections of elements that need to be processed in a particular order. They have multiple applications in operating systems, network...
Implementation Binomial Heap
The binomial heap in data structure stands as a true marvel, combining the elegance of binary trees with the efficiency of heap-based operations. Born from the ingenuity of computer scientists...
Implement Stack Using Queue
In this article, we explore the implementation of stacks using queues and the interplay between push vs pop operations. Stacks, based on the Last-In-First-Out (LIFO) principle, and queues, based on...
Difference between Linear Queue and Circular Queue
In the field of programming, a queue is defined as an abstract data type that is used to store and manage a collection of elements in a particular order (FIFO,...
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...
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
Data structures are an essential part of computer science and programming. Two fundamental data structures that are frequently used are stacks and queues. These data structures provide a way to...
Python Queue using Doubly Linked List
A queue is an ordered collection of elements in which the addition of one element happens at one end known as REAR and the removal of existing elements occurs at...
Python Program for Heap Sort
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 have to...
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...
Difference between Static allocation and Heap allocation
Static allocation: In static allocation, space allocation for all the data objects is done at the compile time. In this type of allocation, all the decisions are made by the...
Implementation of Min Heap in Python
What is Heap? Heap Data structure primarily focuses on representing priority queue. Min - Heap follows the property of a complete binary tree in which the value of the internal...
Implementation of Max Heap in Python
A heap is simply a binary tree with some additional rules that it has to follow. There are two rules which differentiate heap structures from any other tree structure. Rules...
Heap queue or heapq in Python
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 is...