LintCode 375: Clone Binary Tree

最新推荐文章于 2021-04-06 10:03:59 发布

纸上得来终觉浅绝知此事要躬行

最新推荐文章于 2021-04-06 10:03:59 发布

阅读量135

点赞数

CC 4.0 BY-SA版权

分类专栏： algorithm-design 文章标签： LintCode

本文链接：https://blog.youkuaiyun.com/roufoo/article/details/96134600

algorithm-design 专栏收录该内容

817 篇文章

订阅专栏

本文介绍了一种通过深度优先搜索(DFS)算法来实现二叉树的深拷贝方法。具体而言，该方法递归地复制了原始二叉树的每个节点，创建了一个与原树结构完全相同的新树。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Clone Binary Tree
中文English
For the given binary tree, return a deep copy of it.

Example
Example 1:

Input: {1,2,3,4,5}
Output: {1,2,3,4,5}
Explanation:
The binary tree is look like this:
1
/
2 3
/
4 5
Example 2:

Input: {1,2,3}
Output: {1,2,3}
Explanation:
The binary tree is look like this:
1
/
2 3
Notice
You’d better not just return root to solve the problem.

解法1：DFS
代码如下:

/**
 * 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) {
        if (!root) return NULL;
        TreeNode * copyRoot = new TreeNode(root->val);
        copyRoot->left = cloneTree(root->left);
        copyRoot->right = cloneTree(root->right);
        return copyRoot;
    }
};