DaleStudy / DaleStudy/leetcode-study
Construct Binary Tree From Preorder And Inorder Traversal
Open
Nobody has claimed this yet.
problem
- Dominant language
- Python
- Stars
- 156
- Forks
- 359
- Avg merge
- 1d 16h
- Merged PRs (30d)
- 38
Description
- 문제: https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/
- 해설: https://www.algodale.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/construct-binary-tree-from-preorder-and-inorder-traversal
Contributor guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start with the LeetCode problem and the linked explanation, then inspect the construct-binary-tree-from-preorder-and-inorder-traversal/ directory. Add the Python solution there and verify it against the examples and requirements in the problem statement.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- python
- Domain
- backend
- Issue type
- Feature
- Difficulty
- 2/5
- Estimated time
- 1-3 hours
- Activity status
- Stale
- Clarity
- Clearly specified
- Newbie friendliness
- 50/100