lintcode/leetcode由易至难第15题:Merge Two Binary Trees
来源:互联网 发布:房地产动画制作软件 编辑:程序博客网 时间:2024/06/05 22:34
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.
Code:/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public TreeNode mergeTrees(TreeNode t1, TreeNode t2) {
if (t1 == null && t2 == null){
return null;
}
int val = (t1 == null ? 0 : t1.val) + (t2 == null ? 0 : t2.val);
TreeNode newTreeNode = new TreeNode(val);
newTreeNode.left = mergeTrees(t1 == null ? null : t1.left, t2 == null ? null : t2.left);
newTreeNode.right = mergeTrees(t1 == null ? null : t1.right, t2 == null ? null : t2.right);
return newTreeNode;
}
}
- lintcode/leetcode由易至难第15题:Merge Two Binary Trees
- 【leetcode】 Merge Two Binary Trees
- leetcode[Merge Two Binary Trees]
- Merge Two Binary Trees(leetcode)
- [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
- 整洁即是正义
- linux磁盘检测和修复
- 软raid5+lvm步骤
- 编辑器 兼容微信
- 辣鸡数据结构作业:简易银行管理系统
- lintcode/leetcode由易至难第15题:Merge Two Binary Trees
- 55. Jump Game
- Ubuntu卸载VTK,及安装python可用的VTK
- 安卓开发——让系统可以调用自己写的视频播放器
- 12.函数
- Java基础学习笔记 第二部分 part 3
- Oracle Minus关键字
- 0021_Merge Two Sorted Lists
- Java多线程技术研究(四)-Callable,Future/FutureTask,及Future设计模式