LeetCode 230 on Jeanphilo Bloghttps://shio-chan-dev.github.io/jeanblog/tags/leetcode-230/Recent content in LeetCode 230 on Jeanphilo BlogHugo -- 0.161.1en-usMon, 20 Apr 2026 10:01:46 +0800Hot100: Kth Smallest Element in a BST (Inorder Counting / Early Stop ACERS Guide)https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/binary-tree/230-kth-smallest-element-in-a-bst/Mon, 20 Apr 2026 10:01:46 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/binary-tree/230-kth-smallest-element-in-a-bst/A practical guide to LeetCode 230 covering why inorder traversal of a BST is sorted, how to count visits with an explicit stack, and how to stop immediately at the k-th node.