Construct Binary Tree from Preorder and Inorder Traversal Solutions in Python

Number 105

Difficulty Medium

Acceptance 49.0%

Other languages C++, Go

Solutions

Python solution by haoel/leetcode

def buildTree(self, preorder, inorder):
    if inorder:
        i = inorder.index(preorder.pop(0))
        root = TreeNode(inorder[i])
        root.left = self.buildTree(preorder, inorder[:i])
        root.right = self.buildTree(preorder, inorder[i+1:])
        return root

def buildTree(self, preorder, inorder):
    if inorder:
        i = inorder.index(preorder.pop(0))
        root = TreeNode(inorder[i])
        root.left = self.buildTree(preorder, inorder[:i])
        root.right = self.buildTree(preorder, inorder[i+1:])
        return root