Skip to content

Commit

Permalink
rename
Browse files Browse the repository at this point in the history
  • Loading branch information
Azureki committed Mar 15, 2019
1 parent 67f35a6 commit 43b212c
Show file tree
Hide file tree
Showing 2 changed files with 21 additions and 21 deletions.
21 changes: 21 additions & 0 deletions 105. Construct Binary Tree from Preorder and Inorder Traversal.py
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 Construct Binary Tree from Inorder and Postorder Traversal.py

This file was deleted.

0 comments on commit 43b212c

Please sign in to comment.