/**
* 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;
TreeNode node = new TreeNode(root1.val+root2.val);
node.left = mergeTrees(root1.left,root2.left);
node.right = mergeTrees(root1.right,root2.right);
return node;
}
}
【2022初春】【LeetCode】【树】617. 合并二叉树
最新推荐文章于 2024-07-29 20:28:20 发布