Update README.md

QueenieCplusplus · web-flow · commit e59a826fb92c · 2019-12-16T11:07:16.000+08:00
diff --git a/README.md b/README.md
@@ -7,6 +7,6 @@ A double-ended queue is a data structure that supports ops as below:
 
 2) delete ele with largest || smaller key
 
-
+Suppose we wish to insert the ele with key into heap. As in the case of heaps, the insertion algorithm for heap follow the  
 
 

Original file line number	Diff line number	Diff line change
`@@ -7,6 +7,6 @@ A double-ended queue is a data structure that supports ops as below:`
`7`	`7`
`8`	`8`	`2) delete ele with largest \|\| smaller key`
`9`	`9`
`10`		`-`
	`10`	`+Suppose we wish to insert the ele with key into heap. As in the case of heaps, the insertion algorithm for heap follow the`
`11`	`11`
`12`	`12`