Skip to content
Navigation Menu
Sign in
Products
Platform
GitHub
Repository hosting, code review, and collaboration
Copilot
AI coding agent for tasks, projects, and automated work
Build & Ship
Actions
CI/CD and automation
Code Quality
Quality analysis, fixes, and enforcement
Codespaces
Cloud development environments
Secure
Code Security
Vulnerability detection and remediation
Secret Protection
Secret scanning and leak prevention
All Features
Developers
Learn
Documentation
Training
Certifications
Build
Build with Copilot
Customize Copilot
Integrations
Explore
Trending repos
GitHub Sponsors
Developer articles
Changelog
Changelog
Your source for the latest features, improvements, and fixes across GitHub products, all in one place.
Businesses
By Stage
Enterprises
Team
Startups
Nonprofits
By Industry
Healthcare
Financial services
Manufacturing
Government
See all industries
Evaluate GitHub
Why GitHub
Customer Stories
Business insights
Trust Center
Add-ons
GitHub Advanced Security
Enterprise-grade code security
Copilot for business
Enterprise-grade AI features
Premium Support
Enterprise-grade 24/7 support
Resources
Learn & Connect
Documentation
Resource center
Blog
Events & webinars
Community Forum
Customer Stories
Integrations
Support
Customer support
Training
GitHub Status
Company
About
Partners
Changelog
GitHub Universe
GitHub Universe
The event for developers, by developers — talks, workshops, and what’s next for GitHub.
Pricing
Search
/
Sign in
Sign up
Appearance settings
You signed in with another tab or window.
Reload
to refresh your session.
You signed out in another tab or window.
Reload
to refresh your session.
You switched accounts on another tab or window.
Reload
to refresh your session.
Dismiss alert
{{ message }}
ahcodedev
python-ds-algorithms
Repository navigation
Code
Pull requests
Only collaborators can create PRs
Actions
Security and quality
Insights
More
items
Files
Expand file tree
main
Breadcrumbs
python-ds-algorithms
/
src
/
binary_tree
/
tree_from_preorder_inorder.py
Copy path
Blame
More file actions
Blame
More file actions
Latest commit
History
History
History
49 lines (33 loc) · 1.34 KB
main
Breadcrumbs
python-ds-algorithms
/
src
/
binary_tree
/
tree_from_preorder_inorder.py
Copy path
Top
File metadata and controls
Code
Blame
49 lines (33 loc) · 1.34 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
from src.binary_tree.tree_node import TreeNode
def tree_from_preorder_inorder(preorder: list[int] | None, inorder: list[int]) -> TreeNode | None:
r"""Tree From Preorder and Inorder Traversal.
Given preorder and inorder traversal of a tree, construct the binary tree.
Note: You may assume that duplicates do not exist in the tree.
For example, given:
preorder = `[3, 9, 20, 15, 7]` - Top -> Bottom, Left -> Right
inorder = `[9, 3, 15, 20, 7]` - Left -> Node -> Right
Return the following binary tree:
```text
3
/ \
9 20
/ \
15 7
```
Takes the root from the front of preorder, then uses inorder to split and recurse on left, then right.
"""
if not preorder:
return None
def tree_builder(inorder_left_index, inorder_right_index):
nonlocal preorder_index
if inorder_left_index == inorder_right_index:
return None
root = TreeNode(preorder[preorder_index])
inorder_index = index_map[root.val]
preorder_index += 1
root.left = tree_builder(inorder_left_index, inorder_index)
root.right = tree_builder(inorder_index + 1, inorder_right_index)
return root
preorder_index = 0
index_map = {value: index for index, value in enumerate(inorder)}
return tree_builder(0, len(inorder))
You can’t perform that action at this time.