You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: binarysearchtree/README.md
+1-1Lines changed: 1 addition & 1 deletion
Original file line number
Diff line number
Diff line change
@@ -1,5 +1,5 @@
1
1
# Binary Search Tree
2
-
**Statement: Binary trees become truly useful for searching when you balance them**
2
+
**Statement: Binary trees become truly useful for searching when you balance them. This example is not balanced. For such cases, please see AVL and Red-Black Trees examples (links coming soon)**
3
3
4
4
**What kind of problems are commonly solved via binary search tree:**
0 commit comments