LeetCode@Tree_617_Merge_Two_Binary_Trees

最新推荐文章于 2022-05-15 12:53:29 发布

Yanito

最新推荐文章于 2022-05-15 12:53:29 发布

阅读量171

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/qq_33864177/article/details/73578575

版权

LeetCode 专栏收录该内容

39 篇文章 0 订阅

订阅专栏

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.

java:

/**
 * 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)
	{
		TreeNode t = null;
		if(t1 == null && t2 ==null) return null;
		else if(t1 == null) return t2;
		else if(t2 == null) return t1;
		
		t = new TreeNode(t1.val+t2.val);	
		t.left = mergeTrees(t1.left, t2.left);
		t.right = mergeTrees(t1.right, t2.right);
		
		return t;

	}
}