Update README.md

Author: AnghelLeonard

binarytree/README.md

@@ -4,7 +4,7 @@
 **What kind of problems are commonly solved via binary search tree:**
 
 - Used in search applications having data entering/leaving in a constant way (e.g., *map*/*set* objects languages libraries.
-- Binary heaps where higher keys are above or equal to lower ones rather than to the left of (or below or equal to and right).
+- Binary heaps - higher keys are above or equal to lower ones rather than to the left of (or below or equal to and right).
 - Hash trees, similar to hash tables.
 - Implementing routing table in router.
 - To solve database problem such as indexing.