给定一棵二叉搜索树,找出其中的第k小的结点。例如(5,3,7,2,4,6,8)中,按结点数值大小顺序第3小的结点值为4。
import java.util.Stack;
public class T_62_KthNode {
int count = 0;
TreeNode KthNode(TreeNode pRoot, int k) {
if (pRoot != null) {
TreeNode node = KthNode(pRoot.left, k);
if (node != null) {
return node;
}
count++;
if (count == k) {
return pRoot;
}
node = KthNode(pRoot.right, k);
if (node != null) {
return node;
}
}
return null;
}
TreeNode KthNode2(TreeNode pRoot, int k) {
if (pRoot != null) {
Stack<TreeNode> stack = new Stack<>();
while (!stack.isEmpty() || pRoot != null) {
if (pRoot != null) {
stack.push(pRoot);
pRoot = pRoot.left;
} else {
pRoot = stack.pop();
count++;
if (count == k) {
return pRoot;
}
pRoot = pRoot.right;
}
}
}
return null;
}
}