105. Construct Binary Tree from Preorder and Inorder Traversal https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal
106. Construct Binary Tree from Inorder and Postorder Traversal https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal
889. Construct Binary Tree from Preorder and Postorder Traversal https://leetcode.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal
331. Verify Preorder Serialization of a Binary Tree https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree
894. All Possible Full Binary Trees https://leetcode.com/problems/all-possible-full-binary-trees
998. Maximum Binary Tree II https://leetcode.com/problems/maximum-binary-tree-ii
1110. Delete Nodes And Return Forest https://leetcode.com/problems/delete-nodes-and-return-forest
Prerequisites
Before reading this article, you should first learn:
Most commonly, constructing binary trees often involves a problem-decomposition mindset.
