Heap readme file add

Data Structure/Heap/README.md

@@ -3,8 +3,11 @@
 A **Heap** is a tree based data structure and it is a complete binary tree which satisfies the heap ordering property. The ordering can be one of two types:
 
 the **min-heap property:** the value of each node is greater than or equal to the value of its parent, with the minimum-value element at the root.
+
 the **max-heap property:** the value of each node is less than or equal to the value of its parent, with the maximum-value element at the root.
 
+![heap](max_heap_deletion_animation.gif)
+
 **Basic Operations:**
 
 Following are the basic operations supported by a list.
@@ -19,13 +22,11 @@ Following are the basic operations supported by a list.
 
 
 #### Complexity Analysis
-Algorithm	Average     Worst case
-Space		O(n)	    O(n)
-Search		O(n)	    O(n)
-Insert		O(1)	    O(log n)
-Delete		O(log n)	O(log n)
-Peek		O(1)	    O(1)
-
+- Space - O(n)
+- Search - O(n)
+- Insertion - O(1)
+- Delete - O(log n) (Deletion from beginning)
+- Peek - O(1)
 ### More on this topic
 - https://en.wikipedia.org/wiki/Heap_(data_structure)
 - https://www.hackerearth.com/practice/data-structures/trees/heapspriority-queues/tutorial/