leecode-1379-找出克隆二叉树中的相同节点_code1379

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */

class Solution {
    public final TreeNode getTargetCopy(final TreeNode original, final TreeNode cloned, final TreeNode target) {
        // base case
        if (original == null) return null;
        if (original == target) return cloned;
        TreeNode l = getTargetCopy(original.left, cloned.left, target);
        TreeNode r = getTargetCopy(original.right, cloned.right, target);
        return l == null ? r : l;
    }
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20