617 added

Author: aQua

Algorithms/0617.merge-two-binary-trees/README.md

@@ -0,0 +1,32 @@
+# [617. Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees/)
+
+## 题目
+
+Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not.
+
+You need to merge them into a new binary tree. The merge rule is that if two nodes overlap, then sum node values up as the new value of the merged node. Otherwise, the NOT null node will be used as the node of new tree.
+
+Example 1:
+
+```text
+Input:
+Tree 1                     Tree 2
+          1                         2
+         / \                       / \
+        3   2                     1   3
+       /                           \   \
+      5                             4   7
+Output:
+Merged tree:
+     3
+    / \
+   4   5
+  / \   \
+ 5   4   7
+```
+
+Note: The merging process must start from the root nodes of both trees.
+
+## 解题思路
+
+见程序注释

Algorithms/0617.merge-two-binary-trees/merge-two-binary-trees.go

@@ -0,0 +1,12 @@
+package Problem0617
+
+import (
+	"github.com/aQuaYi/LeetCode-in-Go/kit"
+)
+
+type TreeNode = kit.TreeNode
+
+func mergeTrees(t1 *TreeNode, t2 *TreeNode) *TreeNode {
+
+	return nil 
+}

Algorithms/0617.merge-two-binary-trees/merge-two-binary-trees_test.go

@@ -0,0 +1,42 @@
+package Problem0617
+
+import (
+	"fmt"
+	"testing"
+
+	"github.com/aQuaYi/LeetCode-in-Go/kit"
+
+	"github.com/stretchr/testify/assert"
+)
+
+// tcs is testcase slice
+var tcs = []struct {
+	pre1, in1 []int
+	pre2, in2 []int
+	ansPost   []int
+}{
+
+// 可以有多个 testcase
+}
+
+func Test_fn(t *testing.T) {
+	ast := assert.New(t)
+
+	for _, tc := range tcs {
+		fmt.Printf("~~%v~~\n", tc)
+		t1 := kit.PreIn2Tree(tc.pre1, tc.in1)
+		t2 := kit.PreIn2Tree(tc.pre2, tc.in2)
+		ansPost := kit.Tree2Postorder(mergeTrees(t1, t2))
+		ast.Equal(tc.ansPost, ansPost, "输入:%v", tc)
+	}
+}
+
+func Benchmark_fn(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		for _, tc := range tcs {
+			t1 := kit.PreIn2Tree(tc.pre1, tc.in1)
+			t2 := kit.PreIn2Tree(tc.pre2, tc.in2)
+			mergeTrees(t1, t2)
+		}
+	}
+}