Leetcode 1379

1379.py

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

class Solution:
    def getTargetCopy(self, original: TreeNode, cloned: TreeNode, target: TreeNode) -> TreeNode:
        val = target.val
        
        def find(node):
            if not node:
                return
            if node.val == val:
                return node
            return find(node.left) or find(node.right)
        
        return find(cloned)