# Heap<(Of <(<'T>)>)> Class

A binary heap can be efficiently implemented as an array, where a node at index i
has children at indexes 2i and 2i+1 and a parent at index i/2, with one-based indexing.

**Namespace:**
Highpoint.Sage.Utility

**Assembly:**
Sage4 (in Sage4.dll)