Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit bb003f1

Browse files
Merge pull request amejiarosario#4 from bottd/master
Correct spelling in Binary Search Tree description
2 parents 31dbc32 + c58c7a8 commit bb003f1

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

‎README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -87,7 +87,7 @@ We are covering the following data structures.
8787
<!-- [Post](https://adrianmejia.com/blog/2018/06/11/data-structures-for-beginners-trees-binary-search-tree-tutorial/#Binary-Trees) -->
8888

8989
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`.
9191
[Code](https://github.com/amejiarosario/algorithms.js/blob/master/src/data-structures/trees/binary-search-tree.js)
9292
|
9393
[BST Time complexity](https://github.com/amejiarosario/dsa.js/blob/master/book/chapters/tree--binary-search-tree.adoc#tree-complexity)

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /