https://shio-chan-dev.github.io/jeanblog/tags/bst/Recent content in BST on Jeanphilo BlogHugo -- 0.161.1en-usMon, 20 Apr 2026 10:01:46 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/binary-tree/108-convert-sorted-array-to-binary-search-tree/Mon, 20 Apr 2026 10:01:46 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/binary-tree/108-convert-sorted-array-to-binary-search-tree/A practical guide to LeetCode 108 covering why the midpoint is the natural root, how sorted order and balance requirements work together, and how to build the BST with stable index recursion.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.https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/binary-tree/98-validate-binary-search-tree/Sun, 19 Apr 2026 15:13:19 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/binary-tree/98-validate-binary-search-tree/A practical guide to LeetCode 98 covering ancestor range constraints, why parent-only checks fail, and two stable solutions: recursive bounds and inorder validation.