https://shio-chan-dev.github.io/jeanblog/tags/preorder/Recent content in Preorder 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/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).https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/binary-tree/114-flatten-binary-tree-to-linked-list/Mon, 20 Apr 2026 10:01:46 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/binary-tree/114-flatten-binary-tree-to-linked-list/A practical guide to LeetCode 114 covering why the flattened list must follow preorder order and how reverse preorder with a prev pointer gives a stable in-place rewiring strategy.