二叉搜索树的第k个结点

给定一颗二叉搜索树，请找出其中的第k小的结点。

例如， 5 / \ 3 7 /\ /\ 2 4 6 8 中，按结点数值大小顺序第三个结点的值为4。

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

import java.util.Stack; public class Solution {      //中序递归      int count =  0 ;      TreeNode KthNode(TreeNode pRoot,  int k)      {          if (count > k || pRoot ==  null )              return null ;          TreeNode p = pRoot;          Stack<TreeNode> LDRStack =  new Stack<TreeNode>();          TreeNode kthNode =  null ;          while (p !=  null || !LDRStack.isEmpty()){              while (p !=  null ){                  LDRStack.push(p);                  p = p.left;              }              TreeNode node = LDRStack.pop();              System.out.print(node.val+ "," );              count++;              if (count == k){                  kthNode = node;              }              p = node.right;          }          return kthNode;      } }