617. Merge Two Binary Trees
来源:互联网 发布:淘宝一个差评多少钱 编辑:程序博客网 时间:2024/06/08 02:06
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:
这是考试中的一道原题。当时没有考虑到从分部考虑,也是从递归来做。所以一直崩溃。
class Solution {public: TreeNode* mergeTrees(TreeNode* t1, TreeNode* t2) { if(t1 == NULL && t2 == NULL) return t1;if(t1 == NULL && t2 != NULL) return t2;if(t1 != NULL && t2 == NULL) return t1;t1->val += t2->val;t1->left = mergeTrees(t1->left, t2->left);t1->right = mergeTrees(t1->right, t2->right);return t1; }};
阅读全文
0 0
- 617. Merge Two Binary Trees
- 617. Merge Two Binary Trees
- 617. Merge Two Binary Trees
- 617. Merge Two Binary Trees
- 617. Merge Two Binary Trees
- 617. Merge Two Binary Trees
- 617. Merge Two Binary Trees
- 617. Merge Two Binary Trees
- 617. Merge Two Binary Trees
- 617. Merge Two Binary Trees
- 617. Merge Two Binary Trees
- 617. Merge Two Binary Trees
- 617. Merge Two Binary Trees
- 617. Merge Two Binary Trees
- 617. Merge Two Binary Trees
- 617. Merge Two Binary Trees
- 617. Merge Two Binary Trees
- 617. Merge Two Binary Trees
- leetcode 387. First Unique Character in a String
- C++相关小知识点笔记
- xstart使用方法
- 小白实验室-Java:注解
- Hibernate学习总结(三)
- 617. Merge Two Binary Trees
- ES6开发环境配置
- Ubuntu搭建邮件服务器
- HDU 3117 由n^k的前4位,推出(斐波那契)矩阵^k的前四位
- crond和crontab
- C++指针
- C++搜索与回溯算法之Lake Counting(数湖)
- PAT乙级 1066. 图像过滤(15)
- 能不用电视显示器接电脑就不用电视显示器接电脑