题目描述
给定一棵二叉搜索树,请找出其中的第k小的结点。例如, (5,3,7,2,4,6,8) 中,按结点数值大小顺序第三小结点的值为4。
解法一:非递归
/*
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
import java.util.*;
public class Solution {
TreeNode KthNode(TreeNode pRoot, int k)
{
if(pRoot==null || k<=0)
return null;
Stack<TreeNode> stack = new Stack<>();
while(!stack.isEmpty()||pRoot!=null){
while(pRoot!=null){
stack.push(pRoot);
pRoot = pRoot.left;
}
pRoot = stack.pop();
k--;
if(k==0) return pRoot;
pRoot = pRoot.right;
}
return null;
}
}
解法二:递归
public class Solution {
int count = 0;
TreeNode KthNode(TreeNode pRoot, int k)
{
if(pRoot==null) return null;
TreeNode left = KthNode(pRoot.left,k);
if(left!=null) return left;
count++;
if(count==k) return pRoot;
return KthNode(pRoot.right,k);
}
}