Heap

From NovaOrdis Knowledge Base

Revision as of 02:59, 13 August 2018 by Ovidiu (talk | contribs) (→‎Overview)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Internal

Data Structures and Algorithms

Overview

A binary heap data structure is an array where data is placed to form a complete binary tree.

TODO CLRS page 151, page 1177.

Retrieved from "https://kb.novaordis.com/index.php?title=Heap&oldid=48205"