617. 合并二叉树

问题

给定两个二叉树，想象当你将它们中的一个覆盖到另一个上时，两个二叉树的一些节点便会重叠。
你需要将他们合并为一个新的二叉树。合并的规则是如果两个节点重叠，那么将他们的值相加作为节点合并后的新值，否则不为 NULL 的节点将直接作为新二叉树的节点。

例子

思路

递归，修改原树方法和不修改原树方法

代码

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
	//1. 修改原树，更好一些。且因为修改时，会用到结点的val，right，left，所以先保证用时该结点不为空
    public TreeNode mergeTrees(TreeNode t1, TreeNode t2) {
        
        if (t1==null) return t2;
        if (t2==null) return t1;
        //此时t1,t2都不null
        t1.val += t2.val;
        t1.left = mergeTrees(t1.left,t2.left);
        t1.right = mergeTrees(t1.right,t2.right);
        return t1;
    }
    //2. 不修改树
    public TreeNode mergeTrees(TreeNode t1, TreeNode t2) {
      
        if (t1==null && t2==null) return null;
        int i = (t1==null?0:t1.val)+(t2==null?0:t2.val);
        TreeNode node = new TreeNode(i);
        node.left = mergeTrees(t1==null?null:t1.left,t2==null?null:t2.left);
        node.right = mergeTrees(t1==null?null:t1.right,t2==null?null:t2.right);
        
        return node;
       
    }
    
}

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def mergeTrees(self, t1: TreeNode, t2: TreeNode) -> TreeNode:
#   1.修改原树,方法更好，且因为修改时，会用到结点的val，right，left，所以先保证用时该结点不为空
#         if t1 is None: return t2
#         if t2 is None: return t1
        
#         t1.val += t2.val
#         t1.left = self.mergeTrees(t1.left,t2.left)
#         t1.right = self.mergeTrees(t1.right,t2.right)
#         return t1
    #2.不修改原树
        if t1 is None and t2 is None: return None
        a=0 if t1 is None else t1.val
        b=0 if t2 is None else t2.val
        node = TreeNode(a+b)
        node.left = self.mergeTrees(None if t1 is None else t1.left, None if t2 is None else t2.left)
        node.right = self.mergeTrees(None if t1 is None else t1.right, None if t2 is None else t2.right)
        return node