forked from fishercoder1534/Leetcode
-
Notifications
You must be signed in to change notification settings - Fork 1
/
_230.java
33 lines (27 loc) · 839 Bytes
/
_230.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
package com.fishercoder.solutions;
import com.fishercoder.common.classes.TreeNode;
import java.util.ArrayList;
import java.util.List;
public class _230 {
public static class Solution1 {
/**
* Inorder traversal gives the natural ordering of a BST, no need to sort.
*/
public int kthSmallest(TreeNode root, int k) {
List<Integer> inorder = new ArrayList();
dfs(root, inorder, k);
return inorder.get(k - 1);
}
private void dfs(TreeNode root, List<Integer> list, int k) {
if (root == null) {
return;
}
dfs(root.left, list, k);
list.add(root.val);
dfs(root.right, list, k);
if (list.size() >= (k - 1)) {
return;
}
}
}
}