【LeetCode】0617——合并二叉树

题目描述

解题思路

  先处理根结点，1和2，处理完后，t1.left 与 t2.left 又是两个二叉树，t1.right 与 t2.right也是两个二叉树，对左子树和右子树又要做同样的事，很容易想到递归的方法。

Java代码

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

Python3代码

class Solution:
    def mergeTrees(self, t1: TreeNode, t2: TreeNode) -> TreeNode:
        if t1 == None and t2 == None:
            return None
        if t1 != None and t2 == None:
            return t1
        if t1 == None and t2 != None:
            return t2
        
        t1.val = t1.val + t2.val
        t1.left = self.mergeTrees(t1.left, t2.left)
        t1.right = self.mergeTrees(t1.right, t2.right)
        return t1

C++代码

class Solution {
public:
    TreeNode* mergeTrees(TreeNode* t1, TreeNode* t2) {
        if(t1 == NULL && t2 == NULL) return NULL;
        if(t1 != NULL && t2 == NULL) return t1;
        if(t2 != NULL && t1 == NULL) return t2;
        
        t1->val = t1->val + t2->val;
        t1->left = mergeTrees(t1->left, t2->left);
        t1->right = mergeTrees(t1->right, t2->right);
        return t1;
    }
};