【Leetcode Daily】1379找出克隆二叉树中的相同节点

题目浅析

• 想查看原题可以点击题目链接。

• 简单地说，就是给两个相同的二叉树，和一个目标节点，求一个二叉树中另一个二叉树对应的目标节点位置的节点。

思路分享

• 两边一起递归，如果一边二叉树发现当前节点与目标节点相同，就返回目标节点。注意，比较的是节点，不是节点值。

  https://leetcode.cn/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/solutions/2721724/jian-ji-xie-fa-pythonjavacjs-by-endlessc-3vri/

代码解答（强烈建议自行解答后再看）

• 参考题解

# 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 or not cloned:
            return None
        if original is target:
            return cloned 
        return self.getTargetCopy(original.left, cloned.left, target) or self.getTargetCopy(original.right, cloned.right, target)