题目描述
给定一棵二叉搜索树,请找出其中的第k小的结点。例如, (5,3,7,2,4,6,8) 中,按结点数值大小顺序第三小结点的值为4。
思路:
只需要用中序遍历一棵二叉搜索树,就很容易找出它的第k大结点。
/*
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
import java.util.Stack;
public class Solution {
TreeNode KthNode(TreeNode pRoot, int k)
{
int count = 0;
if(count > k || pRoot == null)
return null;
TreeNode p = pRoot;
Stack<TreeNode> myStack = new Stack<TreeNode>();
TreeNode myNode = null;
while(p != null || !myStack.isEmpty()){
while(p != null){
myStack.push(p);
p = p.left;
}
TreeNode node = myStack.pop();
count++;
if(count == k){
myNode = node;
}
p = node.right;
}
return myNode;
}
}