-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathadd one row to tree.cpp
38 lines (33 loc) · 1.05 KB
/
add one row to tree.cpp
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
/**
* 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, bool left = true)
{
if (depth <= 1)
{ // f depth == 1 that means there is no depth depth - 1 at all
TreeNode *temp = new TreeNode(val);
if (left)
temp->left = root;
else
temp->right = root;
return temp;
}
if (root == NULL)
return root;
root->left = addOneRow(root->left, val, depth - 1, true);
root->right = addOneRow(root->right, val, depth - 1, false);
return root;
}
};
// leetcode - 623