617.合并二叉树

题目描述： 

 

 递归思想：

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;
    
    }
}

迭代：

class Solution {
    public TreeNode mergeTrees(TreeNode t1, TreeNode t2) {
    	if(t1==null){
    		return t2;
    	}
    	if(t2==null){
    		return t1;
    	}
    	Stack<TreeNode> A = new Stack<>();
    	Stack<TreeNode> B = new Stack<>();
    	A.push(t1);
    	B.push(t2);
    	while(!A.isEmpty()||!B.isEmpty()){
    		TreeNode s1 = A.pop();
    		TreeNode s2 = B.pop();
    		if(s1.left!=null&&s2.left!=null){
    			A.push(s1.left);
    			B.push(s2.left);
    		}
    		else if(s1.left==null){
    			s1.left = s2.left;
    		}
    		if(s1.right!=null&&s2.right!=null){
    			A.push(s1.right);
    			B.push(s2.right);
    		}
    		else if(s1.right==null){
    			s1.right = s2.right;
    		}
    		s1.val += s2.val;
    	}
    	return t1;
    
    }
}