题目要求：返回一个与给定二叉树相同结构域内容的二叉树 算法思想：克隆二叉树的步骤可分为两步进行，二叉树的前序遍历和前序遍历二叉树 下面直接贴代码：
TreeNode* cloneTree(TreeNode *root) { // Write your code here //PRe order traverse binary tree TreeNode* result_tree = new TreeNode; if(root) { if(root->val) { result_tree->val = root->val; } if(root->left) { result_tree->left = cloneTree(root->left); } if(root->right) { result_tree->right = cloneTree(root->right); } } else { return root; } return result_tree; }新闻热点
疑难解答
