JZ62.二叉搜索树的第k个结点
给定一棵二叉搜索树,请找出其中的第k小的TreeNode结点。
java实现
/*
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 KthNode(TreeNode pRoot, int k) {
if(pRoot != null) {
TreeNode node = KthNode(pRoot.left, k);
if(node != null) return node;
index++;
if(index == k) return pRoot;
node = KthNode(pRoot.right, k);
if(node != null) return node;
}
return null;
}
}