class Solution {
public TreeNode mergeTrees(TreeNode root1, TreeNode root2) {
TreeNode node = new TreeNode();
if(root1 == null && root2 == null) return null;
if(root1 == null || root2 == null){
if(root1 == null) node = root2;
else node = root1;
} else {
node.val = root1.val + root2.val;
node.left = mergeTrees(root1.left,root2.left);
node.right = mergeTrees(root1.right,root2.right);
}
return node;
}
}
已经非常习惯使用dfs了诶