375. 克隆二叉树
深度复制一个二叉树。
给定一个二叉树,返回一个他的 克隆品 。
样例
给定一个二叉树:
1
/ \
2 3
/ \
4 5
返回其相同结构相同数值的克隆二叉树:
1
/ \
2 3
/ \
4 5
/**
* Definition of TreeNode:
* class TreeNode {
* public:
* int val;
* TreeNode *left, *right;
* TreeNode(int val) {
* this->val = val;
* this->left = this->right = NULL;
* }
* }
*/
class Solution {
public:
/**
* @param root: The root of binary tree
* @return: root of new tree
*/
TreeNode * cloneTree(TreeNode * root) {
// write your code here
if(root==NULL)return NULL;
TreeNode *head = new TreeNode(0);
return copy(head,root);
}
TreeNode *copy(TreeNode *a,TreeNode *b){
if(b->left==NULL&&b->right==NULL)return NULL;
a=b;
if(b->left!=NULL){
copy(a->left,b->left);
}
if(b->right!=NULL){
copy(a->right,b->right);
}
return a;
}
};