.Net Implementation of a Priority Queue (aka Heap)
The code represents an F# .Net implementation of a Priority Queue; implemented using a heap data structure. Conceptually once can think of a heap as a balanced binary tree. The tree will have a root, and each node can have up to two children; a left and a right child.
Download Visual Studio
