class Solution {
public:
TreeNode* getTargetCopy(TreeNode* original, TreeNode* cloned, TreeNode* target) {
int value=target->val;
queue<TreeNode*>q;
q.push(cloned);
while(!q.empty()){
int size=q.size();
for(int i=0;i<size;i++){
TreeNode*node= q.front();
q.pop();
if(node->val==value){
return node;
}
if(node->left!=NULL){
q.push(node->left);
}
if(node->right!=NULL){
q.push(node->right);
}
}
}
return NULL;
}
};