fix(docs): fix typo for heaps

Author: amejiarosario

book/content/part03/tree-intro.asc

@@ -90,7 +90,7 @@ image::image33.png[image,width=348,height=189]
 (((Max-Heap)))
 (((Min-Heap)))
 (((Data Structures, Non-Linear, Binary Heap)))
-The heap (max-heap) is a type of binary tree where the children's values are higher than the parent. Opposed to the BST, the left child doesn’t have to be smaller than the right child.
+The heap (max-heap) is a type of binary tree where the parent's value is higher than the value of both children. Opposed to the BST, the left child doesn’t have to be smaller than the right child.
 
 .Heap vs BST
 image::image34.png[image,width=325,height=176]