LeetCode Top 100 Liked Questions 617. Merge Two Binary Trees (Java版； Easy)

welcome to my blog

LeetCode Top 100 Liked Questions 617. Merge Two Binary Trees (Java版; Easy)

题目描述

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

class Solution {
    public TreeNode mergeTrees(TreeNode t1, TreeNode t2) {
        if(t1==null){
            return t2;
        }
        if(t2==null){
            return t1;
        }
        TreeNode root = new TreeNode(t1.val+t2.val);
        root.left = mergeTrees(t1.left, t2.left);
        root.right = mergeTrees(t1.right, t2.right);
        return root;
    }
}

第一次做; 核心:base case!; 递归函数逻辑:将传入的两个节点合并成一个节点, 让该节点分别连向处理好的左孩子和处理好的右孩子, 返回当前节点

class Solution {
    public TreeNode mergeTrees(TreeNode t1, TreeNode t2) {
        //base case
        if(t1==null)
            return t2;
        if(t2==null)
            return t1;
        //
        TreeNode curr = new TreeNode(t1.val+t2.val);
        TreeNode leftRes = mergeTrees(t1.left, t2.left);
        TreeNode rightRes = mergeTrees(t1.right, t2.right);
        curr.left = leftRes;
        curr.right = rightRes;
        return curr;
    }
}