heap initials

Antesh Sharma · Antesh Sharma · commit 9249f858fdd2 · 2022-05-29T20:37:15.000+05:30
diff --git a/src/main/java/com/antesh/dsa/heap/README.md b/src/main/java/com/antesh/dsa/heap/README.md
@@ -22,4 +22,4 @@ There are two kinds of heaps: **Max Heap** and **Min Heap**
 
 **Min Heap:** Each node in the Heap has a value no larger than its child nodes. Therefore, the top element (root node) has the smallest value in the Heap.
 
-![](https://github.com/MissionJava/data-structure-and-algorithm-using-java/tree/main/src/main/java/com/antesh/dsa/heap/min-and-max-heap-diagram.jpg)
+[![https://github.com/MissionJava/data-structure-and-algorithm-using-java/blob/main/src/main/java/com/antesh/dsa/heap/min-and-max-heap-diagram.jpg]](https://github.com/MissionJava/data-structure-and-algorithm-using-java/blob/main/src/main/java/com/antesh/dsa/heap/min-and-max-heap-diagram.jpg)

Original file line number	Diff line number	Diff line change
`@@ -22,4 +22,4 @@ There are two kinds of heaps: Max Heap and Min Heap`
`22`	`22`
`23`	`23`	`Min Heap: Each node in the Heap has a value no larger than its child nodes. Therefore, the top element (root node) has the smallest value in the Heap.`
`24`	`24`
`25`		`-![](https://github.com/MissionJava/data-structure-and-algorithm-using-java/tree/main/src/main/java/com/antesh/dsa/heap/min-and-max-heap-diagram.jpg)`
	`25`	`+[![https://github.com/MissionJava/data-structure-and-algorithm-using-java/blob/main/src/main/java/com/antesh/dsa/heap/min-and-max-heap-diagram.jpg]](https://github.com/MissionJava/data-structure-and-algorithm-using-java/blob/main/src/main/java/com/antesh/dsa/heap/min-and-max-heap-diagram.jpg)`