Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Fix typo in binary search tree section #6

Merged
merged 1 commit into from
Aug 27, 2016
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion itsy-bitsy-data-structures.js
Original file line number Diff line number Diff line change
Expand Up @@ -1293,7 +1293,7 @@ class Tree {
*
* > Note: In order to make this work all values must be unique in the tree.
*
* This makes the traversal find a value very efficient. Say we're trying to
* This makes the traversal to find a value very efficient. Say we're trying to
* find the number 5 in our tree:
*
* (4) <--- 5 > 4, so move right.
Expand Down