-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathAdd_One_Row_To_Tree.java
54 lines (42 loc) · 1.19 KB
/
Add_One_Row_To_Tree.java
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
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public TreeNode helper(TreeNode root,int val,int depth,int currdepth){
if(depth==1){
TreeNode zoo=new TreeNode(val);
zoo.left=root;
return zoo;
}
if(root==null){
return root;
}
if(currdepth==depth-1){
TreeNode leftman=root.left;
TreeNode rightman=root.right;
root.left=new TreeNode(val);
root.right=new TreeNode(val);
root.left.left=leftman;
root.right.right=rightman;
return root;
}
helper(root.left,val,depth,currdepth+1);
helper(root.right,val,depth,currdepth+1);
return root;
}
public TreeNode addOneRow(TreeNode root, int val, int depth) {
return helper(root,val,depth,1);
}
}