forked from AnasImloul/Leetcode-Solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathAdd One Row to Tree.java
40 lines (39 loc) · 1.14 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
/**
* 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 addOneRow(TreeNode root, int val, int depth) {
findAndAdd(root, val, depth, 1);
return root;
}
public void findAndAdd(TreeNode root, int val, int depth, int currDepth){
if(depth == 1 && currDepth == 1){
root.left = new TreeNode(root.val, root.left, root.right);
root.right = null;
root.val = val;
return;
}
if(root == null)
return;
if(currDepth == depth - 1){
root.left = new TreeNode(val, root.left, null);
root.right = new TreeNode(val, null, root.right);
}else{
findAndAdd(root.left, val, depth, currDepth + 1);
findAndAdd(root.right, val, depth, currDepth + 1);
}
return;
}
}