From 704539273742f086178477f2e1a98ea375b92fe1 Mon Sep 17 00:00:00 2001 From: Oleksii Trekhleb Date: Sat, 14 Apr 2018 09:18:21 +0300 Subject: [PATCH] Add README. --- src/data-structures/heap/README.md | 15 +++++++++++++++ 1 file changed, 15 insertions(+) create mode 100644 src/data-structures/heap/README.md diff --git a/src/data-structures/heap/README.md b/src/data-structures/heap/README.md new file mode 100644 index 00000000..69cb6342 --- /dev/null +++ b/src/data-structures/heap/README.md @@ -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. + +![Heap](https://upload.wikimedia.org/wikipedia/commons/3/38/Max-Heap.svg) + +## References + +[Wikipedia](https://en.wikipedia.org/wiki/Heap_(data_structure))