Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not.
You need to merge them into a new binary tree. The merge rule is that if two nodes overlap, then sum node values up as the new value of the merged node. Otherwise, the NOT null node will be used as the node of new tree.
Example 1:
Input: Tree 1 Tree 2 1 2 / \ / \ 3 2 1 3 / \ \ 5 4 7 Output: Merged tree: 3 / \ 4 5 / \ \ 5 4 7
Note:The merging process must start from the root nodes of both trees.
思路:以一棵树为基准,若两节点非空,则将值相加,对应的左右子节点传递进行递归,若基准树左子节点空 非基准树左子节点非空,基准树的当前节点的左子节点指向非基准树左子节点。
代码1:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode* mergeTrees(TreeNode* t1, TreeNode* t2) {
if(t1!=NULL && t2!=NULL){
t1->val += t2->val;
t1->left=mergeTrees(t1->left, t2->left);
t1->right=mergeTrees(t1->right, t2->right);
}
else if(t1==NULL){return t2;}
return t1;
}
};
代码2:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode* mergeTrees(TreeNode* t1, TreeNode* t2) {
if(t1==NULL){return t2;}
if(t2==NULL){return t1;}
TreeNode* root = new TreeNode(t1->val+t2->val);
TreeNode* left=mergeTrees(t1->left,t2->left);
TreeNode* right=mergeTrees(t1->right,t2->right);
root->left=left;
root->right=right;
return root;
}
};
(这是构造了一棵新的树)
代码3:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode* mergeTrees(TreeNode* t1, TreeNode* t2) {
if ( t1 && t2 ) {
TreeNode * root = new TreeNode(t1->val + t2->val);
root->left = mergeTrees(t1->left, t2->left);
root->right = mergeTrees(t1->right, t2->right);
return root;
}
else {return t1 ? t1 : t2;}
}
};
(相比于代码1,该版本代码更为简洁)