# Heap data structure (minheap and maxheap examples)

Heap is physically an array-like storage data structure whereas virtually we can see this as a binary tree. In heap data structure the element in the 0th index represents as the root of the tree and its children indices are calculated using the below formula. Example of Heap Let’s take a heap example that hasRead More »