Merge pull request #1 from amejiarosario/master

Pull updated changes from amejiarosario repo

Author: mut1sya

CHANGELOG.md

@@ -1,3 +1,10 @@
+## [2.7.5](https://github.com/amejiarosario/dsa.js/compare/2.7.4...2.7.5) (2021-05-24)
+
+
+### Bug Fixes
+
+* **bst:** on duplicates values the same node is returned ([d350da8](https://github.com/amejiarosario/dsa.js/commit/d350da8bd2d7cf5c8f4425e863babf19cbdcbdf4)), closes [#99](https://github.com/amejiarosario/dsa.js/issues/99)
+
 ## [2.7.4](https://github.com/amejiarosario/dsa.js/compare/2.7.3...2.7.4) (2021-01-09)
 
 

book/content/part03/tree-intro.asc

@@ -106,6 +106,6 @@ image::image35.png[image,width=258,height=169]
 
 .Heap vs. Binary Search Tree
 ****
-Heap is better at finding max or min values in constant time *O(1)*, while a balanced BST is good a finding any element in *O(log n)*. Heaps are often used to implement priority queues, while BST is used when you need every value sorted.
+Heap is better at finding max or min values in constant time *O(1)*, while a balanced BST is good at finding any element in *O(log n)*. Heaps are often used to implement priority queues, while BST is used when you need every value sorted.
 ****
 indexterm:[Runtime, Logarithmic]