From 7945ec045d903cb846ea91fcc925b1adcb8721f0 Mon Sep 17 00:00:00 2001 From: Donne Martin Date: Thu, 5 Jan 2017 22:59:15 -0500 Subject: [PATCH] Fix bst challenge time complexity discussion (#135) --- graphs_trees/bst/bst_solution.ipynb | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) 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" ]