Binary Heap is the underlying implementation of Priority Queue. A heap can be visualized to have a tree structure logically. This tree satisfies the two heap properties - value property and the shape property. Although the heap is a tree, because of the heap property it's easy to implement it as an array. Binary Heap is… Continue reading Heap – Theory

# Category: Heap

## Priority Queue – Theory

Java Docs In computer science, a priority queue is an abstract data type which is like a regular queue or stack data structure, but where additionally each element has a "priority" associated with it. In a priority queue, an element with high priority is served before an element with low priority. If two elements have the same priority, they are served according to their… Continue reading Priority Queue – Theory

## Heap Problem Set

1,2,3,5,7,12,14, 19/20, 21, 22, **23, **25 Heap is the underlying implementation of Priority Queue. We use Priority Queue classes to implement min and max heaps in Java. SO 1 Index array for heap - Parent = i/2 Child = 2*i , 2*i + 1 Last Non-Leaf Node = floor(n/2) Leaf Node Starts from = floor(n/2… Continue reading Heap Problem Set