-
Notifications
You must be signed in to change notification settings - Fork 0
/
230. Kth Smallest Element in a BST.java
50 lines (50 loc) · 1.28 KB
/
230. Kth Smallest Element in a BST.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
49
50
/**
* 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 int kthSmallest(TreeNode root, int k)
{
TreeNode node;
Stack<TreeNode> s=new Stack<>();
//s.push(root);
if(root==null)
{
return 0;
}
node=root;
int c=0;
TreeNode node1=root;
while(node!=null || s.size()>0)
{
if(c==k)
{
return node1.val;
}
while(node!=null)
{
s.push(node);
node=node.left;
}
node=s.pop();
node1=node;
System.out.println(node.val);
node=node.right;
c++;
}
if(node==null)
{return node1.val;}
return node.val;
}
}