Skip to content

Category Archives: Heap

A priority Queue is a type of queue in which every element is associated with a priority and is served according to its priority.  We… Read More
Given a list intervals of n intervals, the ith element [s, e, p] denotes the starting point s, ending point e, and the profit p… Read More
A Priority Queue is a data structure that allows you to insert elements with a priority, and retrieve the element with the highest priority.  You… Read More
 Given a binary string str and an array of positive integers profit[]. The task is to find the maximum possible sum if we are allowed… Read More
What is Heap? A heap is a tree based data structure where the tree is a complete binary tree that maintains the property that either… Read More
What is Heap? A Heap is a special Tree-based data structure in which the tree is a complete binary tree. Types of Heap Data Structure:… Read More
Prerequisite:  SORT command in Linux/Unix with examples The SORT command in the Linux operating system is used for sorting. It can be done either for… Read More
What is Heap memory? Heaps are memory areas allocated to each program. Memory allocated to heaps can be dynamically allocated, unlike memory allocated to stacks.… Read More
What is Heap? A Heap is a special Tree-based data structure in which the tree is a complete binary tree. There are two types of… Read More
INTRODUCTION: A heap is a specialized tree-based data structure that satisfies the heap property: If A is a parent node of B, then the key… Read More
Given an integer N which denotes the number of elements in a binary heap. Check if the binary Heap is completely filled or not. Examples:… Read More
Given an array arr[] of size N, the task is to find the minimum number of operations required to reduce all three elements of the… Read More
Given an array arr[] which is of 3*N size, the task is to remove N elements and divide the whole array into two equal parts… Read More
A Data Structure organizes and stores data in a computer so that we can perform operations on the data more efficiently. There are many diverse… Read More
Heap is a special tree-based data structure where the tree is always a complete binary tree. Heaps are of two types: Max heap and Min… Read More

Start Your Coding Journey Now!