-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathAdd one row to tree.cpp
38 lines (38 loc) · 1.09 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:
void helper(TreeNode *root,int v,int d,int level){
if(root==NULL) return;
if(level==d-1){
TreeNode *templ=root->left;
TreeNode *tempr=root->right;
root->left=new TreeNode(v);
root->right=new TreeNode(v);
root->left->left=templ;
root->right->right=tempr;
}
helper(root->left,v,d,level+1);
helper(root->right,v,d,level+1);
}
TreeNode* addOneRow(TreeNode* root, int v, int d) {
int level=1;
if(d==1){
TreeNode *temp=root;
root=new TreeNode(v);
root->left=temp;
root->right=NULL;
}
helper(root,v,d,level);
return root;
}
};