题目:
解法:
本题比较简单,判断三种情况:
(1)t1为空,则返回t2;
(2)t2为空,则返回t1;
(3)t1、t2都不为空,则返回t1+t2值的和的结点。
然后直接递归即可。
/**
* 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;
}
TreeNode t = new TreeNode(t1.val+t2.val);
t.left = mergeTrees(t1.left, t2.left);
t.right = mergeTrees(t1.right, t2.right);
return t;
}
}