[리트코드 leetcode] 617. Merge Two Binary Trees

leetcode.com/problems/merge-two-binary-trees/

Merge Two Binary Trees - LeetCode

 

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def mergeTrees(self, root1: TreeNode, root2: TreeNode) -> TreeNode:
        
        def recursive(node1, node2):
            if node1 and node2:
                node1.val += node2.val
                node1.left = recursive(node1.left, node2.left)
                node1.right = recursive(node1.right, node2.right)
                      
            if node2 and not node1:  
                node1 =node2
           
            return node1
        
        return recursive(root1,root2)