/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode* getTargetCopy(TreeNode* original, TreeNode* cloned, TreeNode* target) {
if(!original||!cloned||!target)
{
return NULL;
}
if(original==target)
{
return cloned;
}
return getTargetCopy(original->left,cloned->left,target)!=NULL?getTargetCopy(original->left,cloned->left,target):getTargetCopy(original->right,cloned->right,target);
}
};
LeetCode:1379. 找出克隆二叉树中的相同节点
最新推荐文章于 2023-09-25 00:08:32 发布