https://shio-chan-dev.github.io/jeanblog/tags/leetcode-108/Recent content in LeetCode 108 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.