Merge pull request amejiarosario#4 from bottd/master

amejiarosario · web-flow · commit bb003f186516 · 2019-04-19T00:02:18.000-04:00
Correct spelling in Binary Search Tree description
diff --git a/README.md b/README.md
@@ -87,7 +87,7 @@ We are covering the following data structures.
         <!-- [Post](https://adrianmejia.com/blog/2018/06/11/data-structures-for-beginners-trees-binary-search-tree-tutorial/#Binary-Trees) -->
 
     2. **Binary Search Trees** (BST): same as binary tree, but the
-        nodes value keep this order `left < parent < rigth`.
+        nodes value keep this order `left < parent < right`.
         [Code](https://github.com/amejiarosario/algorithms.js/blob/master/src/data-structures/trees/binary-search-tree.js)
         |
         [BST Time complexity](https://github.com/amejiarosario/dsa.js/blob/master/book/chapters/tree--binary-search-tree.adoc#tree-complexity)

Original file line number	Diff line number	Diff line change
`@@ -87,7 +87,7 @@ We are covering the following data structures.`
`87`	`87`	`<!-- [Post](https://adrianmejia.com/blog/2018/06/11/data-structures-for-beginners-trees-binary-search-tree-tutorial/#Binary-Trees) -->`
`88`	`88`
`89`	`89`	`2. Binary Search Trees (BST): same as binary tree, but the`
`90`		- nodes value keep this order `left < parent < rigth`.
	`90`	+ nodes value keep this order `left < parent < right`.
`91`	`91`	`[Code](https://github.com/amejiarosario/algorithms.js/blob/master/src/data-structures/trees/binary-search-tree.js)`
`92`	`92`	`\|`
`93`	`93`	`[BST Time complexity](https://github.com/amejiarosario/dsa.js/blob/master/book/chapters/tree--binary-search-tree.adoc#tree-complexity)`