Tutorials
Courses

Similar Topics

Web Technologies37.4K+ articles

DSA21.3K+ articles

Python21.3K+ articles

Misc8.5K+ articles

Mathematical7.6K+ articles

Arrays6.1K+ articles

Data Structures990+ articles

Heap260+ articles

Python-DSA233+ articles

priority-queue148+ articles

Data Structures-Heap

25 posts

Difference between Binary Heap, Binomial Heap and Fibonacci Heap

Last Updated: 26 July 2024

Binary Heap:A Binary Heap is a Binary Tree with following properties.It’s a complete binary tree i.e., all levels are completely filled except possibly the last level and ...read more

article_image

Data Structures

Difference Between

Data Structures-Heap

Heap and Priority Queue using heapq module in Python

Last Updated: 10 January 2023

Heaps are widely used tree-like data structures in which the parent nodes satisfy any one of the criteria given below.The value of the parent node in each level is less th...read more

Data Structures-Heap

Heapq with custom predicate in Python

Last Updated: 09 May 2022

Prerequisite: heapq moduleThe heapq module has several functions that take the list as a parameter and arranges it in a min-heap order. The problem with these functions is...read more

Data Structures-Heap

Find min and max values among all maximum leaf nodes from all possible Binary Max Heap

Last Updated: 05 July 2021

Given a positive integer N, the task is to find the largest and smallest elements, from the maximum leaf nodes of every possible binary max-heap formed by taking the first...read more

article_image

Data Structures-Heap

Maximum number of pairs of distinct array elements possible by including each element in only one pair

Last Updated: 26 May 2022

Given an array arr[] consisting of N integers, the task is to find the maximum number of pairs of array elements such that each pair has a different element and each array...read more

Data Structures-Heap

frequency-counting

Split Array into Consecutive Subsequences of Size K or more.

Last Updated: 09 November 2023

Given an integer array arr[] that is sorted in increasing order and an integer K. Check whether it is possible to split arr[] into one or more subsequences such that both ...read more

Data Structures-Heap

Distribution Apples

Last Updated: 12 January 2024

We were given N apple trees and M friends. The ith tree has a[i] apples and it takes b[i] units of energy to pluck an apple from this tree. Find the maximum number of appl...read more

Geeks Premier League

Data Structures

Data Structures-Heap

Geeks Premier League 2023

POTD Solutions | 05 Nov’ 23 | Top K Frequent Elements in Array

Last Updated: 22 November 2023

View all POTD SolutionsWelcome to the daily solutions of our PROBLEM OF THE DAY (POTD). We will discuss the entire problem step-by-step and work towards developing an opti...read more

article_image

Competitive Programming

Data Structures-Heap

GFG-POTD-Solutions

Types of Heap Data Structure

Last Updated: 23 January 2024

Different types of heap data structures include fundamental types like min heap and max heap, binary heap and many more. In this post, we will look into their characterist...read more

article_image

Data Structures-Heap

Python Data Structures Practice Problems

Last Updated: 28 January 2025

Python Data Structures Practice Problems page covers essential structures, from lists and dictionaries to advanced ones like sets, heaps, and deques. These exercises help ...read more

Python Programs

Data Structures-Heap

Python heapq.heapify() Method

Last Updated: 17 March 2025

The heapq.heapify() function in Python is used to transform a regular list into a valid min-heap. A min-heap is a binary tree where the smallest element is always at the r...read more

Data Structures-Heap

Python heapq.nlargest() Method

Last Updated: 17 March 2025

The heapq.nlargest() method in Python is a useful function from the heapq module that returns the n largest elements from an iterable, such as a list or tuple. This method...read more

Data Structures-Heap

Python heapq.nsmallest() Method

Last Updated: 17 March 2025

The heapq.nsmallest() method in Python is part of the heapq module and is used to retrieve the n smallest elements from an iterable, such as a list, tuple or other iterabl...read more

Data Structures-Heap

Python heapq.heapreplace() Method

Last Updated: 21 April 2025

The heapq.heapreplace() function removes and returns the smallest element from a heap (the root) and inserts a new item into the heap, all while maintaining the heap prope...read more

Data Structures-Heap

Python heapq.heappushpop() Method

Last Updated: 17 March 2025

The heapq.heappushpop() method is part of Python's heapq module, which provides an efficient way to implement heaps (also known as priority queues). This method is a combi...read more

Data Structures-Heap