In this paper we introduce the triangular heap, a heap with the special property that for
every father node its right child (if present) is smaller than its left child. We show how
triangular heaps can be applied to the traditional problem of sorting an array in situ
in ways quite similar to well-known methods using ordinary heaps. An average case
analysis is presented for the construction and for the sorting process of both ordinary
and triangular heaps.