forked from varunu28/LeetCode-Java-Solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAdd One Row to Tree.java
More file actions
51 lines (51 loc) · 1.29 KB
/
Add One Row to Tree.java
File metadata and controls
51 lines (51 loc) · 1.29 KB
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
/**
* 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) {
if (depth == 1) {
TreeNode newRoot = new TreeNode(val);
newRoot.left = root;
return newRoot;
}
int currDepth = 1;
Queue<TreeNode> queue = new LinkedList<>();
queue.add(root);
while (currDepth < depth - 1) {
Queue<TreeNode> temp = new LinkedList<>();
while (!queue.isEmpty()) {
TreeNode removed = queue.remove();
if (removed.left != null) {
temp.add(removed.left);
}
if (removed.right != null) {
temp.add(removed.right);
}
}
queue = temp;
currDepth++;
}
while (!queue.isEmpty()) {
TreeNode node = queue.remove();
TreeNode temp = node.left;
node.left = new TreeNode(val);
node.left.left = temp;
temp = node.right;
node.right = new TreeNode(val);
node.right.right = temp;
}
return root;
}
}