Skip to content

Commit 002dceb

Browse files
Update README.md
1 parent df1f1a7 commit 002dceb

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

binarysearchtree/README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
# 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)**
33

44
**What kind of problems are commonly solved via binary search tree:**
55

0 commit comments

Comments
 (0)