Corrected spelling anf grammar errors in docstring for heap. (keon#783)

cliftonamccook · web-flow · commit 0d3e4c12ed8d · 2021-05-30T16:57:25.000-07:00
diff --git a/algorithms/heap/binary_heap.py b/algorithms/heap/binary_heap.py
@@ -1,7 +1,7 @@
 """
-Binary Heap. A min heap is a complete binary tree where each node is smaller
-its childen. The root, therefore, is the minimum element in the tree. The min
-heap use array to represent the data and operation. For example a min heap:
+Binary Heap. A min heap is a complete binary tree where each node is smaller than
+its children. The root, therefore, is the minimum element in the tree. The min
+heap uses an array to represent the data and operation. For example a min heap:
 
      4
    /   \

Original file line number	Diff line number	Diff line change
`@@ -1,7 +1,7 @@`
`1`	`1`	`"""`
`2`		`-Binary Heap. A min heap is a complete binary tree where each node is smaller`
`3`		`-its childen. The root, therefore, is the minimum element in the tree. The min`
`4`		`-heap use array to represent the data and operation. For example a min heap:`
	`2`	`+Binary Heap. A min heap is a complete binary tree where each node is smaller than`
	`3`	`+its children. The root, therefore, is the minimum element in the tree. The min`
	`4`	`+heap uses an array to represent the data and operation. For example a min heap:`
`5`	`5`
`6`	`6`	`4`
`7`	`7`	`/ \`