617. Merge Two Binary Trees
来源:互联网 发布:数据分析师就业前景 编辑:程序博客网 时间:2024/06/04 00:45
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.
实在没有做出来,这是别人的
public class Solution {
public TreeNode MergeTrees(TreeNode l1, TreeNode l2) {
if(l1==null)
{
return l2;
}
if(l2==null)
{
return l1;
}
l1.val += l2.val;
l1.left = MergeTrees(l1.left,l2.left);
l1.right = MergeTrees(l1.right,l2.right);
return l1;
}
}
- 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
- 键盘随意输出任一个数 负数结尾求和
- Ubuntu 16.04 安装配置 JDK 8
- java api 操作 hdfs
- NLTK在python中文字所表达的情感预测
- raspberryPi的omxplayer使用方法
- 617. Merge Two Binary Trees
- Echarts使用
- 基础练习 特殊回文数
- EOJ 2527 Fj & haozi【dfs】
- java--map--线程安全
- 求一个数的绝对值
- CSS3实现图片循环旋转
- 题目名称 : [Conditions] 谁拿了最多奖学金
- word2vec