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

* Update data-structure/heap/README.md

The overuse of parenthesis in the previous description made the
explanation of a heap more diffcult to read. Following technical
writing standards, the topic of the sentence should be at the
forefront of a sentence, to give the reader an idea of what is
going to be explained in said sentence.

The mention of min heap and max heap were previously in parenthesis, in
the middle of the sentence. This change informs the reader that there
are two types of heaps, with a preface indicating which one is being
explained.

* Add min heap picture and move max heap picture

Add a picture of a min heap below the explanation of a min heap.
Move the picture of a max heap below the explanation of a max heap.

* Italicize heap terminology

Italicize the terms 'max heap' and 'min heap' to make it clear to readers that new terminology is being introduced

src/data-structures/heap/README.md

@@ -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))