Data Structure - Binary Heap
Heap is a complete binary tree in which value of any node is less than or equal to the values of its children.
This implies that the least element is always in the root of the tree.
Facts about Heap data structure:
C# implementation - Open on Github
Prim's algorithm is a very special algorithm for me. I have used it to solve one of the tasks during the All-Ukrainian School Olympiad in Informatics in 2001 and got the 3rd degree place. Which in turn helped me to enter the University of my choice.