617. 合并二叉树

思路1

题意是要按照节点对应位置把两颗二叉树进行合并。我们可以同时dfs这两颗二叉树，递归出口分三种情况判断：都空则返回null；一个空一个不空返回不空的。然后左递归，右递归。
代码：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public TreeNode mergeTrees(TreeNode t1, TreeNode t2) {
        if(t1==null) return t2;
        if(t2==null) return t1;
        TreeNode newnode = new TreeNode(t1.val+t2.val);
        newnode.left = mergeTrees(t1.left, t2.left);
        newnode.right = mergeTrees(t1.right, t2.right);
        return newnode;
    }
}

思路二

尝试使用bfs来做,对两颗树同时bfs，叠加值放进第一颗树。

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public TreeNode mergeTrees(TreeNode t1, TreeNode t2) {
        if(t1==null) return t2;
        if(t2==null) return t1;
        Queue<TreeNode> q = new LinkedList<>();
        q.add(t1);
        q.add(t2);
        while(!q.isEmpty()){
            TreeNode node1 = q.poll();
            TreeNode node2 = q.poll();
            node1.val+=node2.val;
            if(node1.left==null){
                node1.left = node2.left;
            }else{
                if(node2.left!=null){
                    q.add(node1.left);
                    q.add(node2.left);
                }
            }
            if(node1.right==null){
                node1.right = node2.right;
            }else{
                if(node2.right!=null){
                    q.add(node1.right);
                    q.add(node2.right);
                }
            }
            
        }
        return t1;
    }
}