Intuition

Just list all nodes with height height - 1 and insert a new layer with the given rules.

Approach

Use a queue to store all nodes with the same height, and use BFS to update the nodes, once we reach the height height - 1, we add a new layer with the given val for each node:

Create a new left child with the given (val, node->left, nullptr)
Create a new right child with the given (val, nullptr, node->right)

Complexity

Time complexity: iterate all nodes of height height - 1
$$O(n)$$
Space complexity: storing all nodes of height height - 1
$$O(n)$$

Code

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    TreeNode* addOneRow(TreeNode* root, int val, int depth) {
        if (depth == 1) {
            TreeNode* new_root = new TreeNode(val, root, nullptr);
            return new_root;
        }
        queue<TreeNode*> q;
        q.push(root);
        --depth;
        while (--depth) {
            int size = q.size();
            for (int i = 0; i < size; ++i) {
                auto node = q.front();
                if (node->left)   q.push(node->left);
                if (node->right)  q.push(node->right);
                q.pop(); 
            }
        }
        while (!q.empty()) {
            auto node = q.front();
            node->left = new TreeNode(val, node->left, nullptr);
            node->right = new TreeNode(val, nullptr, node->right);
            q.pop(); 
        }
        return root;
    }
};

623. Add One Row to Tree

Insert a layer to a binary tree.

Intuition

Approach

Complexity

Code