617. Merge Two Binary Trees
来源:互联网 发布:淘宝代理运营 编辑:程序博客网 时间:2024/05/22 09:04
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.
TreeNode* mergeTrees(TreeNode* t1, TreeNode* t2) { if (t1 == NULL && t2 == NULL)return NULL; if (t1 == NULL && t2 != NULL)return t2; if (t1 != NULL && t2 == NULL)return t1; if (t1 != NULL && t2 != NULL){ 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
- 实现二进制与十进制之间的相互转换
- Android Studio 获取发布版和测试版证书SHA1的两种方式
- 为什么要进行内存对齐以及对齐规则
- HTML5本地储存实现--简易数据库
- 如何使用三层框架开发 JDBC 连接 Mysql 数据库
- 617. Merge Two Binary Trees
- Android 自定义Dialog
- Java实现-三角形计数
- 正则表达式详解
- POJ 1003 题解
- undo log详解
- firefox on ubuntu
- 关于linux socket通讯的accept函数的第三个参数剖析
- 正则表达式(十二)