LeetCode 617. Merge Two Binary Trees
来源:互联网 发布:关闭淘宝手机验证 编辑:程序博客网 时间:2024/06/02 03:56
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.
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */#define null NULLclass Solution {public: TreeNode* mergeTrees(TreeNode* t1, TreeNode* t2) { TreeNode* p1=t1; TreeNode* p2=t2; TreeNode* p3=new TreeNode(0); if(p1!=null&&p2!=null){ t1->val=t1->val+t2->val; t1->left=mergeTrees(t1->left,t2->left); t1->right=mergeTrees(t1->right,t2->right); return t1; } else if(p1==null&&p2!=null){ p3->val=t2->val; t1=p3; t1->left=mergeTrees(t1->left,t2->left); t1->right=mergeTrees(t1->right,t2->right); return t1; } else if(p1!=null&&p1==null){ t1=t1; t1->left=mergeTrees(t1->left,t2->left); t1->right=mergeTrees(t1->right,t2->right); return t1; } else return t1; }};
阅读全文
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>
- vue---watch用法
- Web在jsp页面中生成柱状图,折线图,饼状图
- Kotlin Android 环境搭建
- java.lang.VerifyError: Verifier rejected class bad method
- 5、Spring技术栈-客户端、服务端数据验证
- LeetCode 617. Merge Two Binary Trees
- Hadoop关键技术理解
- HTTP状态码
- LintCode--插入区间
- vue---watch实战
- python 两个列表合并
- 顺序表基本运算算法
- HIVE 概述
- 背包dp之多重背包