LeetCode 105 on Jeanphilo Bloghttps://shio-chan-dev.github.io/jeanblog/tags/leetcode-105/Recent content in LeetCode 105 on Jeanphilo BlogHugo -- 0.161.1en-usMon, 20 Apr 2026 10:01:46 +0800Hot100: Construct Binary Tree from Preorder and Inorder Traversal (Indexed Divide-and-Conquer ACERS Guide)https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/binary-tree/105-construct-binary-tree-from-preorder-and-inorder-traversal/Mon, 20 Apr 2026 10:01:46 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/binary-tree/105-construct-binary-tree-from-preorder-and-inorder-traversal/A practical guide to LeetCode 105 covering how preorder chooses the root, how inorder splits the subtrees, and how a hash map plus index recursion reduces reconstruction to O(n).