do you need a heap?
Use it whenever you need quick access to the largest (or smallest) item, because that item will always be the first element in the array or at the root of the tree. ... A heap is a tree where a parent node's value is larger than that of any of its descendant nodes.