617. 合并二叉树
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public TreeNode mergeTrees(TreeNode root1, TreeNode root2) {
if(root1 == null && root2 == null)
return null;
if(root1 == null && root2 != null)
return root2;
if(root1 != null && root2 == null)
return root1;
// 到这里说明root1和root2都不为null
TreeNode mergeNode = new TreeNode(root1.val + root2.val);
mergeNode.left = mergeTrees(root1.left, root2.left); // 到这里需要重新设定mergeNode 的左孩子和右孩子。
mergeNode.right = mergeTrees(root1.right, root2.right);
return mergeNode;
}
}