Time: 4 ms (32.1%), Space: 6.1 MB (18.51%) - LeetHub

hovanhoa · Dec 13, 2024 · 4bbfec3 · 4bbfec3
1 parent d794235
commit 4bbfec3
Showing 1 changed file with 1 addition and 1 deletion.
diff --git a/...r-and-inorder-traversal/0105-construct-binary-tree-from-preorder-and-inorder-traversal.go b/...r-and-inorder-traversal/0105-construct-binary-tree-from-preorder-and-inorder-traversal.go
@@ -14,6 +14,6 @@ func buildTree(preorder []int, inorder []int) *TreeNode {
     root := &TreeNode{Val: preorder[0]}
     i := slices.Index(inorder, preorder[0])
     root.Left = buildTree(preorder[1:1+i], inorder[:i])
-    root.Right = buildTree(preorder[1+i:], inorder[i+1:])
+    root.Right = buildTree(preorder[i+1:], inorder[i+1:])
     return root
 }