diff --git a/src/data-structures/heap/README.md b/src/data-structures/heap/README.md
index c4c48eff..799c3fd8 100644
--- a/src/data-structures/heap/README.md
+++ b/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))