We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 592bbf2 commit e7fd5f7Copy full SHA for e7fd5f7
README.md
@@ -20,7 +20,7 @@ Commit your code regularly and meaningfully. This helps both you (in case you ev
20
21
This Sprint Challenge is split into three parts:
22
23
-1. Writing an algorithm to search through a binary search tree
+1. Writing an algorithm to traverse through a binary search tree
24
2. Optimizing some inefficient code
25
3. Analyzing time and space complexities from parts 1 and 2
26
0 commit comments