/*
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
public class Solution {
//二叉搜索树中序遍历是按需从小到大的遍历
int index = 0;
TreeNode node =null;
TreeNode KthNode(TreeNode pRoot, int k)
{
if(k == 0 || pRoot == null){
return node;
}
KthNode(pRoot.left,k);
index++;
if(k == index){
node = pRoot;
return node;
}
KthNode(pRoot.right,k);
return node;
}
}
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
public class Solution {
//二叉搜索树中序遍历是按需从小到大的遍历
int index = 0;
TreeNode node =null;
TreeNode KthNode(TreeNode pRoot, int k)
{
if(k == 0 || pRoot == null){
return node;
}
KthNode(pRoot.left,k);
index++;
if(k == index){
node = pRoot;
return node;
}
KthNode(pRoot.right,k);
return node;
}
}