Leetcode 623 - Add One Row to Tree (dfs)

最新推荐文章于 2023-03-25 21:19:59 发布

Lzed

最新推荐文章于 2023-03-25 21:19:59 发布

阅读量379

点赞数

分类专栏： leetcode tree 文章标签： leetcode

本文链接：https://blog.csdn.net/Lzedo/article/details/76400666

版权

leetcode 同时被 2 个专栏收录

157 篇文章 0 订阅

订阅专栏

tree

16 篇文章 0 订阅

订阅专栏

Link

https://leetcode.com/problems/add-one-row-to-tree/description/

Solution

首先，处理特殊情况：若d == 1，新添加的节点将成为根结点
然后，对于一般情况：dfs到d - 1层，根据要求添加节点即可

Code

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    void addOneRowHelper(TreeNode* root, int v, int d, int dep) {
        if (d - 1 == dep) {
            TreeNode* leftNode = root->left;
            TreeNode* rightNode = root->right;
            root->left = new TreeNode(v);
            root->right = new TreeNode(v);
            root->left->left = leftNode;
            root->right->right = rightNode;
        } else {
            if (root->left) addOneRowHelper(root->left, v, d, dep + 1);
            if (root->right) addOneRowHelper(root->right, v, d, dep + 1);
        }
    }
    TreeNode* addOneRow(TreeNode* root, int v, int d) {
        if (d == 1) {
            TreeNode* newRoot = new TreeNode(v);
            newRoot->left = root;
            return newRoot;
        }
        addOneRowHelper(root, v, d, 1);
        return root;
    }
};