Quite simply, the root node is usually the minimum element while in the heap. Here's an example of the min heap tree: Example of min HeapArray representation of the above mentioned min heapCharaHe was rarely by yourself, however. Will Borgen and Jamie Oleksiak also took some rather boneheaded penalties tonight and Seattle didn’t find yourself acq