/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public void InorderTraverse(TreeNode root,List list)
{
if(root!=null)
{
InorderTraverse(root.left,list);
list.add(root.val);
InorderTraverse(root.right,list);
}
}
public int kthSmallest(TreeNode root, int k) {
List <Integer> list=new ArrayList<Integer>();
InorderTraverse(root,list);
return list.get(k-1);
}
}