leetcode算法

617. 合并二叉树（点击查看原题）

解题思路

1.递归法

对两棵树同时进行先序遍历，如果两棵树的当前结点都不是空，就把它们的值相加；如果有一棵树当前结点为空，就返回另一棵树的值。

/**
 * 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;
		}
        t1.val=t1.val+t2.val;
        t1.left=mergeTrees(t1.left, t2.left);
        t1.right=mergeTrees(t1.right, t2.right);
        return t1;
    }
}

2. 迭代法

/**
 * 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;
		}
    	Stack<TreeNode[]> stack=new Stack<TreeNode[]>();
    	stack.push(new TreeNode[]{t1,t2});
    	while (!stack.isEmpty()) {
			TreeNode[] treeNodes=stack.pop();
			if (treeNodes[0]==null||treeNodes[1]==null) {
				continue;
			}
			treeNodes[0].val+=treeNodes[1].val;
			if (treeNodes[0].left==null) {
				treeNodes[0].left=treeNodes[1].left;
			}else {
				stack.push(new TreeNode[] {treeNodes[0].left,treeNodes[1].left});
			}
			if (treeNodes[0].right==null) {
				treeNodes[0].right=treeNodes[1].right;
			}else {
				stack.push(new TreeNode[] {treeNodes[0].right,treeNodes[1].right});
			}
		}
        return t1;
    }
}