Update ConstructBinaryTreePreorderInorder.swift

soapyigu · web-flow · commit 0375a9538fac · 2019-09-14T19:10:42.000-07:00
diff --git a/Tree/ConstructBinaryTreePreorderInorder.swift b/Tree/ConstructBinaryTreePreorderInorder.swift
@@ -2,7 +2,7 @@
  * Question Link: https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/
  * Primary idea: Always use the first element in preorder as root, 
  *               then find that one in inorder to get left and right subtrees
- * Time Complexity: O(n), Space Complexity: O(n)
+ * Time Complexity: O(nlogn), Space Complexity: O(1)
  * 
  * Definition for a binary tree node.
  * public class TreeNode {

Original file line number	Diff line number	Diff line change
`@@ -2,7 +2,7 @@`
`2`	`2`	`* Question Link: https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/`
`3`	`3`	`* Primary idea: Always use the first element in preorder as root,`
`4`	`4`	`* then find that one in inorder to get left and right subtrees`
`5`		`- * Time Complexity: O(n), Space Complexity: O(n)`
	`5`	`+ * Time Complexity: O(nlogn), Space Complexity: O(1)`
`6`	`6`	`*`
`7`	`7`	`* Definition for a binary tree node.`
`8`	`8`	`* public class TreeNode {`