Time: 3 ms (50.65%), Space: 5.9 MB (50.08%) - LeetHub

hovanhoa · Dec 13, 2024 · d794235 · d794235
1 parent 1844ca4
commit d794235
Showing 1 changed file with 19 additions and 0 deletions.
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
@@ -0,0 +1,19 @@
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ *     Val int
+ *     Left *TreeNode
+ *     Right *TreeNode
+ * }
+ */
+func buildTree(preorder []int, inorder []int) *TreeNode {
+    if len(preorder) == 0 || len(inorder) == 0 {
+        return nil
+    }
+
+    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:])
+    return root
+}