lintcode/leetcode由易至难第15题:Merge Two Binary Trees
2017-06-21 19:52
513 查看
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:
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;
}
}
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;
}
}
相关文章推荐
- LeetCode--Merge Two Binary Trees(合并两个二叉树)Python
- The Solution to Leetcode 617 Merge Two Binary Trees
- LeetCode@Tree_617_Merge_Two_Binary_Trees
- Merge Two Binary Trees [LeetCode 617]
- LeetCode 617 Merge Two Binary Trees(递归合并二叉树)
- leetcode Merge Two Binary Trees 合并二叉树
- leetcode(617). Merge Two Binary Trees
- LeetCode-617-Merge Two Binary Trees-E
- Leetcode代码学习周记——Merge Two Binary Trees
- 【LeetCode】617 Merge Two Binary Trees
- Leetcode 617 Merge Two Binary Trees 二叉树
- [LeetCode] Merge Two Binary Trees 合并二叉树
- LeetCode——Merge Two Binary Trees
- 【Leetcode】Merge Two Binary Trees 合并两个二叉树
- LeetCode - Merge Two Binary Trees
- LeetCode Merge Two Binary Trees
- leetcode之Merge Two Binary Trees
- 【leetcode】 Merge Two Binary Trees
- leetcode 617 merge two binary trees
- 算法分析与设计——LeetCode Problem.617 Merge Two Binary Trees