题目描述
给定一棵二叉搜索树,请找出其中的第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.ArrayList;
public class Solution {
ArrayList<TreeNode> res = new ArrayList<TreeNode>();
TreeNode KthNode(TreeNode pRoot, int k)
{ if(k==0) return null;
//ArrayList<TreeNode> res =
saveNode(pRoot);
if(k>res.size()) return null;
return res.get(k-1);
}
void saveNode(TreeNode root){
if(root==null) return ;
saveNode(root.left);
res.add(root);
saveNode(root.right);
}
}
第K个跳出,非递归
/*
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
import java.util.ArrayList;
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>(); //建立栈
TreeNode cur = pRoot;
//while 部分为中序遍历
while(!stack.isEmpty() || cur != null){
if(cur != null){
stack.push(cur); //当前节点不为null,应该寻找左儿子
cur = cur.left;
}else{
cur = stack.pop();//当前节点null则弹出栈内元素,相当于按顺序输出最小值。
if(--k == 0){ //计数器功能
return cur;
}
cur = cur.right;
}
}
return null;
}
}