From a53915fbbcfe4d2ae32eb204b44b173d3a472456 Mon Sep 17 00:00:00 2001 From: Adrian Mejia Date: Wed, 12 Feb 2020 10:50:29 -0500 Subject: [PATCH] fix(docs): fix typo for heaps --- book/content/part03/tree-intro.asc | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/book/content/part03/tree-intro.asc b/book/content/part03/tree-intro.asc index 4778e014..f95fb889 100644 --- a/book/content/part03/tree-intro.asc +++ b/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]