Heap

From NovaOrdis Knowledge Base
Revision as of 01:35, 12 September 2018 by Ovidiu (talk | contribs)
Jump to navigation Jump to search

Internal

Overview

A binary heap data structure is an array where data is placed to form a complete binary tree, plus the index of the last node in the heap.

TODO CLRS page 151, page 1177.