-
Notifications
You must be signed in to change notification settings - Fork 0
/
617.go
69 lines (54 loc) · 1.26 KB
/
617.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
/*
# ------------------------------ #
# #
# version 0.0.1 #
# #
# Aleksiej Ostrowski, 2023 #
# #
# https://aleksiej.com #
# #
# ------------------------------ #
*/
package main
import (
"fmt"
)
/**
* Definition for a binary tree node.
**/
type TreeNode struct {
Val int
Left *TreeNode
Right *TreeNode
}
func mergeTrees(root1 *TreeNode, root2 *TreeNode) *TreeNode {
if root1 != nil || root2 != nil {
v := 0
var l1, l2, r1, r2 *TreeNode
if root1 != nil {
v += root1.Val
l1 = root1.Left
r1 = root1.Right
}
if root2 != nil {
v += root2.Val
l2 = root2.Left
r2 = root2.Right
}
return &TreeNode{v, mergeTrees(l1, l2), mergeTrees(r1, r2)}
}
return nil
}
func main() {
tree_1_2 := &TreeNode{2, nil, nil}
tree_1_5 := &TreeNode{5, nil, nil}
tree_1_3 := &TreeNode{3, tree_1_5, nil}
tree_1 := &TreeNode{1, tree_1_3, tree_1_2}
tree_2_4 := &TreeNode{4, nil, nil}
tree_2_7 := &TreeNode{7, nil, nil}
tree_2_1 := &TreeNode{1, nil, tree_2_4}
tree_2_3 := &TreeNode{3, nil, tree_2_7}
tree_2 := &TreeNode{2, tree_2_1, tree_2_3}
fmt.Println(mergeTrees(tree_1, tree_2))
fmt.Println("ok")
}