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

jhwhu · May 30, 2021 · 0d3e4c1 · 0d3e4c1
1 parent 339a0d2
commit 0d3e4c1
Showing 1 changed file with 3 additions and 3 deletions.
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
    /   \