mirror of
https://github.com/trekhleb/javascript-algorithms.git
synced 2025-07-07 01:44:52 +08:00
Add README.
This commit is contained in:
15
src/data-structures/heap/README.md
Normal file
15
src/data-structures/heap/README.md
Normal file
@ -0,0 +1,15 @@
|
|||||||
|
# Heap (data-structure)
|
||||||
|
|
||||||
|
In computer science, a heap is a specialized tree-based
|
||||||
|
data structure that satisfies the heap property: if `P`
|
||||||
|
is a parent node of `C`, then the key (the value) of `P`
|
||||||
|
is either greater than or equal to (in a max heap) or
|
||||||
|
less than or equal to (in a min heap) the key of `C`.
|
||||||
|
The node at the "top" of the heap (with no parents) is
|
||||||
|
called the root node.
|
||||||
|
|
||||||
|

|
||||||
|
|
||||||
|
## References
|
||||||
|
|
||||||
|
[Wikipedia](https://en.wikipedia.org/wiki/Heap_(data_structure))
|
Reference in New Issue
Block a user