617. Merge Two Binary Trees
来源:互联网 发布:whatsapp mac版 编辑:程序博客网 时间:2024/06/03 20:22
617. Merge Two Binary Trees
Problem
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.
Implementation
/** * 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) { return NULL; } else if(!t1) { return t2; } else if(!t2) { return t1; } else { t1->val = t1->val + t2->val; TreeNode* left = mergeTrees(t1->left, t2->left); TreeNode* right = mergeTrees(t1->right, t2->right); t1->left = left; t1->right = 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
- 判断链表是否带环?若带环求环的长度?若带环求环的入口点?
- RMQ----不更新点
- JSON序列化
- 单向链表的构造
- 公钥,私钥和数字签名这样最好理解
- 617. Merge Two Binary Trees
- tomcat处理一个请求的过程
- 超参数的选择与交叉验证
- photo picker
- ZOJ 1015-Fishing Net(判断弦图)
- javascript 高级程序设计 笔记
- Java调用MATLAB
- java.util.concurrent解析——FutureTask源码解析
- 深度学习的分布式训练