LeetCode 230. Kth Smallest Element in a BST

最新推荐文章于 2024-10-01 05:04:32 发布

Cloud陈

最新推荐文章于 2024-10-01 05:04:32 发布

阅读量237

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/shengyingpo/article/details/53998015

版权

LeetCode 专栏收录该内容

161 篇文章 0 订阅

订阅专栏

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public int kthSmallest(TreeNode root, int k) {
        Stack<TreeNode> stack = new Stack<TreeNode>();
    	while (root != null) {
    		stack.push(root);
    		root = root.left;
    	}
    	while (k != 0) {
    		TreeNode n = stack.pop();
    		if (--k == 0) return n.val;
    		n = n.right;
    		while (n != null) {
    			stack.push(n);
    			n = n.left;
    		}
    	}
    	return Integer.MIN_VALUE;
    }
}