Heap

Tags

comp-sci

A data-structure represented as a binary tree (backed by a [see page 6, special] array), where the root of a node has a property that extends recursively to the left and right sub-trees.

Through this we can show that the root-node of a max-heap is the largest element of that heap and the root for a min-heap is the smallest element.