Heap Class

A top-heavy heap implementation which keeps its members in a semi-ordered fashion and returns them in an ordered fashion

For a list of all members of this type, see Heap Members.

System.Object
   Heap

Remarks

Based on a left-balanced binary tree - implemented on a simple array The heap grows and shrinks by doubling/halving its size starting with a size of 10 This code was inspired by the interface to the heap implementation presented in "Mastering Algorithms with C" by Kyle Loudon, published by O'Reilly & Associates.

Requirements

Namespace: Microsoft.Samples.Collections

Assembly: Microsoft.Samples.Collections (in Microsoft.Samples.Collections.dll)

See Also

Heap Members | Microsoft.Samples.Collections Namespace