题目描述:
This problem is in a contest:
Career Fair Warm Up I . Submit your code and see your ranking!
For the given binary tree, return a deep copy of it.
Example
题目思路:
Given a binary tree:
1
/ \
2 3
/ \
4 5
return the new binary tree with same structure and same value:
1
/ \
2 3
/ \
4 5
这题就是recursion的思路,比较简单。
Mycode(AC = 14ms):
/**
* 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 *copy_root = new TreeNode(root->val);
copy_root->left = cloneTree(root->left);
copy_root->right = cloneTree(root->right);
return copy_root;
}
};