hxx/javascript-algorithms
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/trekhleb/javascript-algorithms.git synced 2024-11-14 06:52:59 +08:00
Code Issues Packages Projects Releases Wiki Activity
22b323e6b1
javascript-algorithms/src/data-structures/heap
History
Oleksii Trekhleb 929b210b8e Minor fixes.
2020-08-09 14:16:42 +02:00
..
__test__ Fix issue #179. 2018-08-27 16:30:18 +03:00
Heap.js Clean up Heaps. 2018-08-30 08:25:38 +03:00
MaxHeap.js Move common Max/Min Heap code to Heap.js. 2018-08-17 10:23:07 +03:00
MinHeap.js Move common Max/Min Heap code to Heap.js. 2018-08-17 10:23:07 +03:00
README.fr-FR.md Minor fixes. 2020-08-09 14:16:42 +02:00
README.ja-JP.md Add Japanese translation (#1) (#337) 2019-04-12 08:32:08 +03:00
README.md Add french translation for some chapters (#520) 2020-08-09 14:10:15 +02:00
README.pt-BR.md pt-BR translations fixes. 2019-04-16 18:05:39 +03:00
README.ru-RU.md Translate heap into Russian. Add links to main README file. (#317) 2019-03-08 12:50:40 +02:00
README.zh-CN.md Update README.zh-CN.md (#326) 2019-03-22 07:28:12 +02:00

README.md

Heap (data-structure)

Read this in other languages: 简体中文, Русский, 日本語, Français, Português

In computer science, a heap is a specialized tree-based data structure that satisfies the heap property described below.

In a min heap, if P is a parent node of C, then the key (the value) of P is less than or equal to the key of C.

MinHeap

In a max heap, the key of P is greater than or equal to the key of C

Heap

The node at the "top" of the heap with no parents is called the root node.

References