forked from fishercoder1534/Leetcode
-
Notifications
You must be signed in to change notification settings - Fork 1
/
_897.java
42 lines (37 loc) · 1.29 KB
/
_897.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
package com.fishercoder.solutions;
import com.fishercoder.common.classes.TreeNode;
import java.util.ArrayList;
import java.util.List;
public class _897 {
public static class Solution1 {
public TreeNode increasingBST(TreeNode root) {
List<Integer> inorderList = new ArrayList<>();
inorderTraversal(root, inorderList);
return constructTree(inorderList);
}
private TreeNode constructTree(List<Integer> inorderList) {
if (inorderList.isEmpty() || inorderList.size() == 0) {
return null;
}
TreeNode root = new TreeNode(inorderList.get(0));
TreeNode tmp = root;
for (int i = 1; i < inorderList.size(); i++) {
tmp.right = new TreeNode(inorderList.get(i));
tmp = tmp.right;
}
return root;
}
private void inorderTraversal(TreeNode root, List<Integer> inorderList) {
if (root == null) {
return;
}
if (root.left != null) {
inorderTraversal(root.left, inorderList);
}
inorderList.add(root.val);
if (root.right != null) {
inorderTraversal(root.right, inorderList);
}
}
}
}