forked from AnasImloul/Leetcode-Solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathConvert BST to Greater Tree.java
51 lines (43 loc) · 1.26 KB
/
Convert BST to Greater 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
class Solution {
public TreeNode convertBST(TreeNode root) {
if(root!=null) {
List<Integer> nodesValues = new ArrayList<>();
helperNodesVales(root, nodesValues);
traverseAndAdd(root, nodesValues);
return root;
}
return null;
}
private void helperNodesVales(TreeNode root, List<Integer> nodesValues) {
if (root != null) {
nodesValues.add(root.val);
}
if (root.right != null) {
helperNodesVales(root.right, nodesValues);
}
if (root.left != null) {
helperNodesVales(root.left, nodesValues);
}
if (root == null) {
return;
}
}
private void traverseAndAdd(TreeNode root, List<Integer> nodesValues) {
if (root != null) {
int rootVal = root.val;
for (int i = 0; i < nodesValues.size(); i++) {
if (nodesValues.get(i) > rootVal)
root.val += nodesValues.get(i);
}
}
if (root.right != null) {
traverseAndAdd(root.right, nodesValues);
}
if (root.left != null) {
traverseAndAdd(root.left, nodesValues);
}
if (root == null) {
return;
}
}
}