105. 从前序与中序遍历序列构造二叉树 https://leetcode.cn/problems/construct-binary-tree-from-preorder-and-inorder-traversal
106. 从中序与后序遍历序列构造二叉树 https://leetcode.cn/problems/construct-binary-tree-from-inorder-and-postorder-traversal
889. 根据前序和后序遍历构造二叉树 https://leetcode.cn/problems/construct-binary-tree-from-preorder-and-postorder-traversal
331. 验证二叉树的前序序列化 https://leetcode.cn/problems/verify-preorder-serialization-of-a-binary-tree
894. 所有可能的满二叉树 https://leetcode.cn/problems/all-possible-full-binary-trees
998. 最大二叉树 II https://leetcode.cn/problems/maximum-binary-tree-ii
1110. 删点成林 https://leetcode.cn/problems/delete-nodes-and-return-forest
最常见的，二叉树的构造问题一般都会用到分解问题的思维模式。
