-
Notifications
You must be signed in to change notification settings - Fork 1
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
2 changed files
with
21 additions
and
21 deletions.
There are no files selected for viewing
21 changes: 21 additions & 0 deletions
21
105. Construct Binary Tree from Preorder and Inorder Traversal.py
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,21 @@ | ||
# Definition for a binary tree node. | ||
# class TreeNode: | ||
# def __init__(self, x): | ||
# self.val = x | ||
# self.left = None | ||
# self.right = None | ||
|
||
|
||
class Solution: | ||
def buildTree(self, preorder, inorder): | ||
""" | ||
:type preorder: List[int] | ||
:type inorder: List[int] | ||
:rtype: TreeNode | ||
""" | ||
if not preorder: return None | ||
i = inorder.index(preorder[0]) | ||
root = TreeNode(preorder[0]) | ||
root.left = self.buildTree(preorder[1:1 + i], inorder[:i]) | ||
root.right = self.buildTree(preorder[1 + i:], inorder[i + 1:]) | ||
return root |
21 changes: 0 additions & 21 deletions
21
Construct Binary Tree from Inorder and Postorder Traversal.py
This file was deleted.
Oops, something went wrong.