Open In App
Related Articles

Heap Data Structure

Improve
Improve
Improve
Like Article
Like
Save Article
Save
Report issue
Report

A Heap is a complete binary tree data structure that satisfies the heap property: for every node, the value of its children is less than or equal to its own value. Heaps are often used to implement priority queues, where the smallest (or largest) element is always at the root of the tree.

Heap Data Structure

Introduction to Heap Data Structure:

Some other types of Heap Data Structure:

Standard Easy Problems on Heap Data Structure:

Standard Medium Problems on Heap Data Structure:

Standard Hard Problems on Heap Data Structure:

Quick Links:

Recommended:



Last Updated : 22 Feb, 2024
Like Article
Save Article
Share your thoughts in the comments
Similar Reads