合并二叉树,从根节点开始,如果两个节点重叠,那么将这两个节点的值相加作为合并后节点的新值;否则,不为 null 的节点将直接作为新二叉树的节点。
- 这道题的解法是同过父节点来操作左右子节点
- 如果两个节点重叠,则值相加作为新的节点
- 如果一棵树为null,不为null的节点作为新二叉树的节点(分为两种情况)
- 共分为上述三种情况,使用if条件语句进行判断,然后做出相应操作即可
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
void mergeTree(TreeNode* root, TreeNode* root1, TreeNode* root2){
if(root1->left == nullptr && root1->right ==nullptr && root2->left == nullptr && root2->right == nullptr){
return;
}
if(root1->left != nullptr && root2->left != nullptr){
TreeNode* node = new TreeNode(root1->left->val + root2->left->val);
root->left = node;
mergeTree(root->left, root1->left, root2->left);
}else if(root1->left == nullptr && root2->left != nullptr){
root->left = root2->left;
}else if(root1->left != nullptr && root2->left == nullptr){
root->left = root1->left;
}
if(root1->right != nullptr && root2->right != nullptr){
TreeNode* node = new TreeNode(root1->right->val + root2->right->val);
root->right = node;
mergeTree(root->right, root1->right, root2->right);
}else if(root1->right == nullptr && root2->right != nullptr){
root->right = root2->right;
}else if(root1->right != nullptr && root2->right == nullptr){
root->right = root1->right;
}
}
TreeNode* mergeTrees(TreeNode* root1, TreeNode* root2) {
if(root1 == nullptr && root2 == nullptr){
return nullptr;
}else if(root1 == nullptr && root2 != nullptr){
return root2;
}else if(root1 != nullptr && root2 == nullptr){
return root1;
}
TreeNode* root = new TreeNode(root1->val + root2->val);
mergeTree(root, root1, root2);
return root;
}
};
看了代码随想录的题解,自己的条件判断似乎有些过于重复了:
class Solution {
public:
TreeNode* mergeTrees(TreeNode* t1, TreeNode* t2) {
if (t1 == NULL) return t2;
if (t2 == NULL) return t1;
// 重新定义新的节点,不修改原有两个树的结构
TreeNode* root = new TreeNode(0);
root->val = t1->val + t2->val;
root->left = mergeTrees(t1->left, t2->left);
root->right = mergeTrees(t1->right, t2->right);
return root;
}
};