LeetCode - Merge Two Binary Tree

LeetCode - 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.

大体意思是：将两个二叉树合并，相同位置的节点值相加

我的思路：遍历两个树，将相同位置的值相加，重组新的树。

我的代码

public TreeNode mergeTrees(TreeNode t1, TreeNode t2) {
        if(t1==null&&t2==null){
            return null;
        }
        TreeNode newTree = null;
        if(t1==null){
            newTree = new TreeNode(t2.val);
            newTree.left = mergeTrees(null, t2.left);
            newTree.right = mergeTrees(null, t2.right);
        }else if(t2==null){
            newTree = new TreeNode(t1.val);
            newTree.left = mergeTrees(t1.left, null);
            newTree.right = mergeTrees(t1.right, null);
        }else{
            newTree = new TreeNode(t2.val+t1.val);
            newTree.left = mergeTrees(t1.left, t2.left);
            newTree.right = mergeTrees(t1.right, t2.right);
        }

        return newTree;
    }

思路没什么问题，但是在判断层面做了一些多余的问题。比如：在t1==null之后直接返回t2就可以，不必要再做其他操作。

更改后代码：

public TreeNode mergeTrees1(TreeNode t1, TreeNode t2) {
        if (t1 == null) {
            return t2;
        }
        if (t2 == null) {
            return t1;
        }
        TreeNode newTree = new TreeNode(t2.val + t1.val);
        newTree.left = mergeTrees(t1.left, t2.left);
        newTree.right = mergeTrees(t1.right, t2.right);

        return newTree;
    }

更改后的代码更简洁，运行速度也提升了。

总结：问题要想得透彻点，不急于下手写代码。