复制二叉树可以使用递归的方法:
TreeNode* Copy(TreeNode* root)
{
if(root == nullptr)
{
return nullptr;
}
TreeNode* leftNode = Copy(root->left);
TreeNode* rightNode = Copy(root->right);
TreeNode* cur = root;
cur->left = leftNode;
cur-> right = rightNode;
cur-> val = root->val;
return cur;
}