617. Merge Two Binary Trees
2017-07-10 11:20
309 查看
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.
/**
* 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;
else if(t1==null&&t2!=null)return t1=t2;
else if(t1!=null&&t2==null)return t1;
else t1.val+=t2.val;
if(t1.left!=null&&t2.left!=null)mergeTrees(t1.left,t2.left);
else if(t1.left==null&&t2.left!=null)t1.left=t2.left;
if(t1.right!=null&&t2.right!=null)mergeTrees(t1.right,t2.right);
else if(t1.right==null&&t2.right!=null)t1.right=t2.right;
return t1;
}
}
一个简单的两树合并问题
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.
/**
* 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;
else if(t1==null&&t2!=null)return t1=t2;
else if(t1!=null&&t2==null)return t1;
else t1.val+=t2.val;
if(t1.left!=null&&t2.left!=null)mergeTrees(t1.left,t2.left);
else if(t1.left==null&&t2.left!=null)t1.left=t2.left;
if(t1.right!=null&&t2.right!=null)mergeTrees(t1.right,t2.right);
else if(t1.right==null&&t2.right!=null)t1.right=t2.right;
return t1;
}
}
一个简单的两树合并问题
相关文章推荐
- python--leetcode617. Merge Two Binary Trees
- leetcode 617. Merge Two Binary Trees
- Add to List 617. Merge Two Binary Trees
- LeetCode: 617. Merge Two Binary Trees
- leetcode 617. Merge Two Binary Trees
- [LeetCode]617. Merge Two Binary Trees<Java>
- 617. Merge Two Binary Trees
- leetcode 617. Merge Two Binary Trees Python实现以及and操作符用法
- leetcode专题—617. Merge Two Binary Trees
- Leetcode 617. Merge Two Binary Trees.(Java)
- Add to List 617. Merge Two Binary Trees
- 617. Merge Two Binary Trees
- 617. Merge Two Binary Trees
- 617. Merge Two Binary Trees(Java)
- 617. Merge Two Binary Trees
- 617. Merge Two Binary Trees; Difficulty:Easy
- 617. Merge Two Binary Trees(合并二叉树)
- 617. Merge Two Binary Trees
- leetcode - 617. Merge Two Binary Trees【双树遍历 + null 模拟遍历 + 结点复用】
- 【leetcode】617. Merge Two Binary Trees