leetcode算法练习---二叉搜索树中第K小的元素

题目描述

给定一个二叉搜索树的根节点 root ，和一个整数 k ，请你设计一个算法查找其中第 k 个最小元素（从 1 开始计数）。

思路

利用二叉搜索树的中序遍历是单调递增
则第K小的就是第K-1的值

在栈的帮助下，可以将方法一的递归转换为迭代，这样可以加快速度，因为这样可以不用遍历整个树，可以在找到答案后停止。

代码

public class Solution {
    public static void main(String[] args) {
        TreeNode treeNode_2=new TreeNode(2,null,null);
        TreeNode treeNode_4=new TreeNode(4,null,null);
        TreeNode treeNode_3=new TreeNode(3,treeNode_2,treeNode_4);
        TreeNode treeNode_7=new TreeNode(7,null,null);
        TreeNode treeNode_6=new TreeNode(6,null,treeNode_7);
        TreeNode treeNode_5=new TreeNode(5,treeNode_3,treeNode_6);
        int search_val = kthSmallest(treeNode_5, 3);
        System.out.println(search_val);
    }
    public static int kthSmallest(TreeNode root, int k) {
        LinkedList<TreeNode> stack = new LinkedList<TreeNode>();
        for (;;){
            while (root !=null){
                stack.add(root);
                root=root.left;
            }
            root=stack.removeLast();
            if(--k==0){
                return root.val;
            }
            root=root.right;
        }
    }

}


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;
  }
}

---

补充-二叉树的中序遍历

和上边的是1个思路

package algorithm;

import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;

public class Solution {
    public static void main(String[] args) {
        TreeNode treeNode_2=new TreeNode(2,null,null);
        TreeNode treeNode_4=new TreeNode(4,null,null);
        TreeNode treeNode_3=new TreeNode(3,treeNode_2,treeNode_4);
        TreeNode treeNode_7=new TreeNode(7,null,null);
        TreeNode treeNode_6=new TreeNode(6,null,treeNode_7);
        TreeNode treeNode_5=new TreeNode(5,treeNode_3,treeNode_6);
        List<Integer> inorder = inorder(treeNode_5);
        for (Integer item : inorder) {
            System.out.println(item);
        }
    }
    public static List<Integer> inorder(TreeNode root) {
        List<Integer> list=new ArrayList<>();
        LinkedList<TreeNode> stack = new LinkedList<TreeNode>();
        while (root!=null || !stack.isEmpty()){
            while (root !=null){
                stack.add(root);
                root=root.left;
            }
            root=stack.removeLast();
            list.add(root.val);
            root=root.right;
        }
        return list;
    }

}


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;
  }
}