From e3e5e4bf35b057653f973d9324efa20c62191ff5 Mon Sep 17 00:00:00 2001
From: marina <138340846+bt3gl-cryptographer@users.noreply.github.com>
Date: Thu, 3 Aug 2023 14:28:06 -0700
Subject: [PATCH] Update README.md

---
 trees/README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/trees/README.md b/trees/README.md
index 2f50f43..027ee5b 100644
--- a/trees/README.md
+++ b/trees/README.md
@@ -21,7 +21,7 @@
 <br>
 
 * **binary search tree** are binary trees where all nodes on the left are smaller than the root, which is smaller than all nodes on the right.
-* if a bst is **balanced**, it guarantees `O(log(N))` for insert and search. common types of balanced trees: **red-black** and **avl**.
+* if a bst is **balanced**, it guarantees `O(log(N))` for insert and search (as we keep the tree's height as `H = log(N)`). common types of balanced trees: **red-black** and **avl**.
 
 <br>