[leetcode]617. Merge Two Binary Trees
来源:互联网 发布:java工程师是干什么的 编辑:程序博客网 时间:2024/06/05 15:01
题目链接: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
class Solution {public: TreeNode* mergeTrees(TreeNode* t1, TreeNode* t2) { if(!t1 && !t2) return NULL; TreeNode* node=new TreeNode((t1?t1->val:0)+(t2?t2->val:0)); node->left=mergeTrees((t1?t1->left:NULL),(t2?t2->left:NULL)); node->right=mergeTrees((t1?t1->right:NULL),(t2?t2->right:NULL)); return node; }};
阅读全文
0 0
- [leetcode]617. Merge Two Binary Trees
- leetcode.617.Merge Two Binary Trees
- [leetcode]: 617. Merge Two Binary Trees
- [Leetcode]617. Merge Two Binary Trees
- LeetCode 617. Merge Two Binary Trees (C++)
- LeetCode 617. Merge Two Binary Trees
- [LeetCode] 617. Merge Two Binary Trees
- LeetCode 617. Merge Two Binary Trees
- 【Leetcode】617. Merge Two Binary Trees
- [LeetCode]617.Merge Two Binary Trees
- LeetCode: 617. Merge Two Binary Trees
- Leetcode 617. Merge Two Binary Trees
- [leetcode]617. Merge Two Binary Trees
- [Leetcode] 617. Merge Two Binary Trees
- [LeetCode]617. Merge Two Binary Trees
- leetcode 617. Merge Two Binary Trees
- 【LeetCode】617. Merge Two Binary Trees
- [LeetCode]617. Merge Two Binary Trees<Java>
- SpringBoot在自定义类中调用service层等Spring其他层
- 无缝滚动小练习—animation
- 如何去自定义一个Toast?
- angularjs 图片上传 回显
- Android 使用Scheme实现从网页启动APP
- [leetcode]617. Merge Two Binary Trees
- Groovy 特殊语法
- 两个栈实现一个队列功能
- Android程序真退出与假退出后台运行详解
- 获取屏幕宽高的四种方法
- Groovy 属性访问
- iOS封装.a文件
- Java高并发,如何解决,什么方式解决
- Kotlin 可见性修饰符