Leetcode代码学习周记——Merge Two Binary Trees
2018-01-20 19:18
453 查看
题目链接:
https://leetcode.com/problems/merge-two-binary-trees/description/
题目描述:
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:
对给定两个二叉树进行求和合并。
题解:
对同一位置的结点:1.若两棵树该位置节点均为空,则返回空 2.若有一棵树该节点为空,则返回另一棵树 3.否则,将两个结点的值相加后的结点返回。
然后分别对1和2的左右子树进行递归调用。
代码:
class Solution {
public:
TreeNode* mergeTrees(TreeNode* t1, TreeNode* t2) {
if (t1 == NULL && t2 == NULL) return NULL;
if (t1 == NULL) return t2;
if (t2 == NULL) return t1;
TreeNode *t = new TreeNode(t1->val + t2->val);
t->left = mergeTrees(t1->left, t2->left);
t->right = mergeTrees(t1->right, t2->right);
return t;
}
};
https://leetcode.com/problems/merge-two-binary-trees/description/
题目描述:
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
对给定两个二叉树进行求和合并。
题解:
对同一位置的结点:1.若两棵树该位置节点均为空,则返回空 2.若有一棵树该节点为空,则返回另一棵树 3.否则,将两个结点的值相加后的结点返回。
然后分别对1和2的左右子树进行递归调用。
代码:
class Solution {
public:
TreeNode* mergeTrees(TreeNode* t1, TreeNode* t2) {
if (t1 == NULL && t2 == NULL) return NULL;
if (t1 == NULL) return t2;
if (t2 == NULL) return t1;
TreeNode *t = new TreeNode(t1->val + t2->val);
t->left = mergeTrees(t1->left, t2->left);
t->right = mergeTrees(t1->right, t2->right);
return t;
}
};
相关文章推荐
- leetcode(617). Merge Two Binary Trees
- leetcode 617 merge two binary trees
- LeetCode--Merge Two Binary Trees(合并两个二叉树)Python
- leetcode[Merge Two Binary Trees]
- 【LeetCode】617 Merge Two Binary Trees
- leetcode 617:Merge Two Binary Trees
- LeetCode@Tree_617_Merge_Two_Binary_Trees
- The Solution to Leetcode 617 Merge Two Binary Trees
- Leetcode代码学习周记——Add Two Nmubers
- 【LeetCode大法】Merge Two Binary Trees
- LeetCode-617-Merge Two Binary Trees-E
- LeetCode 617 Merge Two Binary Trees(递归合并二叉树)
- 【Leetcode】Merge Two Binary Trees 合并两个二叉树
- LeetCode(617) Merge Two Binary Trees
- lintcode/leetcode由易至难第15题:Merge Two Binary Trees
- [LeetCode]Merge Two Binary Trees
- LeetCode Merge Two Binary Trees
- LeetCode - Merge Two Binary Trees
- leetcode之Merge Two Binary Trees
- leetcode Merge Two Binary Trees 合并二叉树