> For the complete documentation index, see [llms.txt](https://chenxing-cao.gitbook.io/space/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://chenxing-cao.gitbook.io/space/data-structure/heap.md).

# Heap

##

{% embed url="<https://www.geeksforgeeks.org/heap-data-structure/>" %}

A Binary Heap is either Min Heap or Max Heap. In a Min Binary Heap, the key at root must be minimum among all keys present in Binary Heap. The same property must be recursively true for all nodes in Binary Tree. Max Binary Heap is similar to MinHeap.