Heaps

Question 1

What is a heap?

Answer 1

special binary tree, where each node has a value that is equal or lower value than the parent.

The root always contains the highest priority.

No horizontal relationship between nodes.

Question 2

Min Heap vs Max Heap

Answer 2

A min-heap sorts values from smallest to largest. The root node will always have the smallest value in the heap.
A max-heap sorts values from largest to smallest. The root node will always have the largest value in the heap.