Heap: Difference between revisions
Jump to navigation
Jump to search
(→INSERT) |
|||
| Line 14: | Line 14: | ||
=Supported Operations= | =Supported Operations= | ||
==<tt>INSERT</tt>== | ==<tt>INSERT</tt>== | ||
Insert a node in the tree. | |||
==<tt>EXTRACT-MIN</tt>== | ==<tt>EXTRACT-MIN</tt>== | ||
Revision as of 21:45, 9 October 2021
External
Internal
Overview
This article is about binary heaps. 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. Each element of the array contains a pointer to tree nodes. Each node contains at least a key.
More details CLRS page 151, page 1177.
Supported Operations
INSERT
Insert a node in the tree.