Skip to content

Improve data-structures/heap/README.md #94

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 3 commits into from
Jul 8, 2018
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
19 changes: 13 additions & 6 deletions src/data-structures/heap/README.md
Original file line number Diff line number Diff line change
@@ -1,15 +1,22 @@
# 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.
data structure that satisfies the heap property.

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](https://upload.wikimedia.org/wikipedia/commons/6/69/Min-heap.png)

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

![Heap](https://upload.wikimedia.org/wikipedia/commons/3/38/Max-Heap.svg)

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))
Expand Down