克隆二叉树

深度复制一个二叉树。

给定一个二叉树，返回一个他的 克隆品 。

样例

样例1:

输入: {1,2,3,4,5}
输出: {1,2,3,4,5}
解释：
样例中二叉树如下所示:
     1
   /  \
  2    3
 / \
4   5

样例2:

输入: {1,2,3}
输出: {1,2,3}
解释：
样例中二叉树如下所示:
   1
 /  \
2    3

注意事项

你最好不要仅仅通过return root来通过此题。

 

/**
 * 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
        return mycopy(root);
    }
    
    TreeNode * mycopy(TreeNode * root)
    {
        if(root == NULL)
            return NULL;
        else if(root->left == NULL && root->right == NULL)
        {
            TreeNode* tmp = new TreeNode(root->val);
            return tmp;
        }
        TreeNode* tmp = new TreeNode(root->val);
        TreeNode * left = mycopy(root->left);
        TreeNode * right = mycopy(root->right);
        tmp->left = left;
        tmp->right = right;
        return  tmp;
        
    }
    
};