题目描述
给定一棵二叉搜索树,请找出其中的第k小的结点。例如, (5,3,7,2,4,6,8) 中,按结点数值大小顺序第三小结点的值为4。
来源:https://www.nowcoder.com/practice/ef068f602dde4d28aab2b210e859150a?tpId=13&tqId=11215&tPage=4&rp=4&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
思路:二叉搜索树按照中序遍历的顺序打印出来正好就是排序好的顺序。所以,按照中序遍历顺序找到第k个结点就是结果。
/*
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
//1.递归:
public class Solution {
private int index = 0;
TreeNode KthNode(TreeNode root, int k) {
if(root!=null){
TreeNode left = KthNode(root.left,k);
if(left!=null){
return left;
}
index++;
if(index==k){
return root;
}
TreeNode right = KthNode(root.right,k);
if(right!=null){
return right;
}
}
return null;
}
}
2.非递归
import java.util.Stack;
public class Solution {
TreeNode KthNode(TreeNode pRoot, int k) {
if(pRoot==null||k<=0){
return null;
}
Stack<TreeNode> stack = new Stack<>();
TreeNode cur = pRoot;
int count = 0;
while(cur!=null||!stack.isEmpty()){
while(cur!=null){
stack.push(cur);
cur = cur.left;
}
cur = stack.pop();
if(++count==k){
return cur;
}
cur = cur.right;
}
return null;
}
}