c# leetcode 617 合并二叉树(完美算法)

 

 

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