617. 合并二叉树

用递归的方法去遍历二叉树是最简单的方法

public class Solution {
    public TreeNode mergeTrees(TreeNode t1, TreeNode t2) {
        if (t1 == null)
            return t2;
        if (t2 == null)
            return t1;
        t1.val += t2.val; //中，可以对这行代码进行位置调整，实现中序和后序遍历
        t1.left = mergeTrees(t1.left, t2.left);  //左
        t1.right = mergeTrees(t1.right, t2.right); //右
        return t1;
    }
}

另一种方法，参考原作者

https://mp.weixin.qq.com/s?__biz=MzI3NzIwMjk4OA==&mid=2247483946&idx=1&sn=b8da06fc3fcc9fe0578305420f8f1942&chksm=eb689369dc1f1a7f566fcc6fd34c7d28b8006f3f02f81568b4f3bb72616563dd0da9ca9a7956&mpshare=1&scene=23&srcid=&sharer_sharetime=1588948652798&sharer_shareid=ac11f0b33b3f01f55650b6c5eeb96ac0#rd