leetcode1379

class Solution:
    def __init__(self):
        self.result = TreeNode(-1)
        
    def preOrder(self,node,target):
        if node != None:
            if node.val == target.val:
                self.result = node
                return
            self.preOrder(node.left,target)
            self.preOrder(node.right,target)
    
    def getTargetCopy(self, original: TreeNode, cloned: TreeNode, target: TreeNode) -> TreeNode:
        self.preOrder(cloned,target)
        return self.result

算法思路：二叉树遍历。