LeetCode｜1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree

.

题目

Given two binary trees original and cloned and given a reference to a node target in the original tree.

The cloned tree is a copy of the original tree.

Return a reference to the same node in the cloned tree.

Note that you are not allowed to change any of the two trees or the target node and the answer must be a reference to a node in the cloned tree.

Example 1:

• Input: tree = [7,4,3,null,null,6,19], target = 3
• Output: 3
• Explanation: In all examples the original and cloned trees are shown. The target node is a green node from the original tree. The answer is the yellow node from the cloned tree.

Example 2:

• Input: tree = [7], target = 7
• Output: 7

Example 3:

• Input: tree = [8,null,6,null,5,null,4,null,3,null,2,null,1], target = 4
• Output: 4

Constraints:

• The number of nodes in the tree is in the range [1, 104].
• The values of the nodes of the tree are unique.
• target node is a node from the original tree and is not null.

.

思路

简单的二叉树遍历问题，仍然在熟悉python的语法。

.

代码

# 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:

        if not original:
            return
        if original == target:
            return cloned
            
        return self.getTargetCopy(original.left, cloned.left, target) or  self.getTargetCopy(original.right, cloned.right, target)        
        

.

分析

这道简单题写了很长时间，语法还是不太熟悉。
最主要的问题在于需要弄清楚python函数内局部变量和全局变量的传递关系。

.