Find a Corresponding Node of a Binary Tree in a Clone of That Tree LeetCode solution in Python

1
# Runtime: 1109 ms (Top 30.14%) | Memory: 24.2 MB (Top 19.53%)
2
class Solution:
3
    def getTargetCopy(
4
        self, original: TreeNode, cloned: TreeNode, target: TreeNode
5
    ) -> TreeNode:
6
        def DFS(node1, node2):
7
            if node1 == target:
8
                return node2
9
            if node1 and node1.left is None and node1.right is None:
10
                return
11

12
            res1 = DFS(node1.left, node2.left) if node1 else None
13
            if res1 is not None:
14
                return res1
15
            res2 = DFS(node1.right, node2.right) if node1 else None
16
            if res2 is not None:
17
                return res2
18

19
        res = DFS(original, cloned)
20
        return res