TreeNode* mergeTrees(TreeNode* root1, TreeNode* root2) {
if(root1==nullptr){
return root2;
}else if(root2==nullptr){
return root1;
}
TreeNode* root=new TreeNode(root1->val + root2->val);
root->left=mergeTrees(root1->left,root2->left);
root->right=mergeTrees(root1->right,root2->right);
return root;
}
标签:遍历,TreeNode,mergeTrees,root,right,LC617,root1,root2
From: https://www.cnblogs.com/lwx11111/p/16664403.html