diff --git a/graphs_trees/bst/bst_solution.ipynb b/graphs_trees/bst/bst_solution.ipynb
index e58af89..914acdd 100644
--- a/graphs_trees/bst/bst_solution.ipynb
+++ b/graphs_trees/bst/bst_solution.ipynb
@@ -84,7 +84,7 @@
     "Complexity:\n",
     "\n",
     "* Time: O(h), where h is the height of the tree\n",
-    "    * In a balanced tree, the height is O(nlogn)\n",
+    "    * In a balanced tree, the height is O(log(n))\n",
     "    * In the worst case we have a linked list structure with O(n)\n",
     "* Space: O(m), where m is the recursion depth, or O(1) if using an iterative approach"
    ]