In Data Structures and Algorithms (DSA), a Heap is a complete binary tree that maintains a specific order between parent and child nodes, known as the Heap Property. In a Min-Heap, the parent node is always smaller than its children, with the smallest element at the root. In a Max-Heap, the parent is larger than its children, with the largest element at the root. Heaps are commonly used to implement priority queues and support operations like insert, delete, and peek efficiently, with a time complexity of O(log n) for insertions and deletions.

Answers

I Need help In DSA

Baibhav

100

1 Learn .NET

Whats is Heap in DSA

Answers (2)

Forum Statistics

Please welcome our newest member Jenica .
2,381,650 users have contributed to 122,515 threads and 389,026
In the past 24 hours, we have 0 new threads, 0 new posts, and 0 new users.
In last week, the most popular thread is 'what is generative Engine optimization'.

Upcoming Events

View all

How Gen AI is Reshaping Content, Code, and Commerce

Our Training Programs

View all

AI & Machine Learning
Mastering Large Language Models
Mastering Prompt Engineering
Certified Vibe Coder
Github Copilot Training
Generative AI for Beginners
n8n Automation & AI Agents Training