375 克隆二叉树

/**
 * 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 root;
    }
    TreeNode *newnode=new TreeNode(root->val);
    newnode->left=cloneTree(root->left);
    newnode->right=cloneTree(root->right);
    return newnode;
    }
};