递归法 class Solution { public: TreeNode* mergeTrees(TreeNode* root1, TreeNode* root2) { if(root1==nullptr) return root2; if(root2==nullptr) return root1; TreeNode* root=new TreeNode(0); root->val=root1->val+root2->val; root->left