Heap

From NovaOrdis Knowledge Base

Revision as of 21:58, 8 October 2021 by Ovidiu (talk | contribs) (→‎Overview)

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

Jump to navigation Jump to search

Internal

Data Structures

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.

More details CLRS page 151, page 1177.

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