【Hot100】LeetCode—230. 二叉搜索树中第 K 小的元素

---

• 原题连接：230. 二叉搜索树中第 K 小的元素

---

1- 思路

中序遍历（栈）+ get(k-1)

• 1- 中序遍历
  • 借助队列 Stack 和 cur 指针实现
  • 1-1 Stack默认加入 root
  • 1-2 借助 while 实现遍历：
  • 1-3 如果 cur!=null 此时，继续左移
  • 1-4 否则，此时需要处理结果，将 cur.val 加到结果集，之后右移
• **2- 将中序的结果存入 List res **
  • 最后 res.get(k-1)

---

2- 实现

⭐230. 二叉搜索树中第 K 小的元素——题解思路

class Solution {
    public int kthSmallest(TreeNode root, int k) {
        inorder(root);
        
        if(root==null){
            return -1;
        }

        return res.get(k-1);

    }

    List<Integer> res = new ArrayList<>();
    public List<Integer> inorder(TreeNode root){
        // 中序
        if(root==null){
            return res;
        }
        // 栈和指针
        TreeNode cur = root;
        Stack<TreeNode> st = new Stack<>();
        while(cur!=null || !st.isEmpty()){
            if(cur!=null){
                st.add(cur);
                cur = cur.left;
            }else{
                cur = st.pop();
                res.add(cur.val);
                cur = cur.right;
            }
        }
        return res;
    }
}

---

3- ACM 实现

public class kthSmallest {


    public static class TreeNode {
        int val;
        TreeNode left;
        TreeNode right;
        TreeNode() {}
        TreeNode(int val) { this.val = val; }
        TreeNode(int val, TreeNode left, TreeNode right) {
            this.val = val;
            this.left = left;
            this.right = right;
        }
    }

    public static TreeNode build(String str){
        if(str == null || str.length()==0){
            return null;
        }
        String input = str.replace("[","");
        input = input.replace("]","");
        String[] parts = input.split(",");

        Integer[] nums = new Integer[parts.length];
        for(int i = 0 ; i < parts.length;i++){
            if(!parts[i].equals("null")){
                nums[i] = Integer.parseInt(parts[i]);
            }else{
                nums[i] = null;
            }
        }
        Queue<TreeNode> queue = new LinkedList<>();
        TreeNode root = new TreeNode(nums[0]);
        queue.offer(root);
        int index = 1;
        while(!queue.isEmpty()&& index<parts.length){
            TreeNode node = queue.poll();
            if(index<nums.length && nums[index]!=null){
                node.left = new TreeNode(nums[index]);
                queue.offer(node.left);
            }
            index++;
            if(index<nums.length && nums[index]!=null){
                node.right = new TreeNode(nums[index]);
                queue.offer(node.right);
            }
            index++;
        }
        return root;
    }

    public static int kthSmallest(TreeNode root, int k) {
        inorder(root);

        if(root==null){
            return -1;
        }

        return res.get(k-1);

    }

    static List<Integer> res = new ArrayList<>();
    public static List<Integer> inorder(TreeNode root){
        // 中序
        if(root==null){
            return res;
        }
        // 栈和指针
        TreeNode cur = root;
        Stack<TreeNode> st = new Stack<>();
        while(cur!=null || !st.isEmpty()){
            if(cur!=null){
                st.add(cur);
                cur = cur.left;
            }else{
                cur = st.pop();
                res.add(cur.val);
                cur = cur.right;
            }
        }
        return res;
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String input = sc.nextLine();
        TreeNode root = build(input);
        System.out.println("输入k");
        int k = sc.nextInt();
        System.out.println("结果是"+kthSmallest(root,k));
    }
}