Fixed time complexity for constructBinary

nhistory · nhistory · commit 96a0c3967afc · 2024-06-22T18:47:20.000-03:00
diff --git a/construct-binary-tree-from-preorder-and-inorder-traversal/nhistory.js b/construct-binary-tree-from-preorder-and-inorder-traversal/nhistory.js
@@ -13,5 +13,5 @@ var buildTree = function (preorder, inorder) {
   return root;
 };
 
-// TC: O(n)
+// TC: O(n^2)
 // SC: O(n)
