leetcode 105. Construct Binary Tree from Preorder and Inorder Traversal (medium)

https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/
preorder [ 3 / 9 / 20 15 7 / ]
inorder [ / 9 / 3 / 15 20 7 / ]
preorder[0]就是根节点，此时inorder中该节点的左部分是属于左子树，右部分属于右子树，根据该节点在inorder中的位置pos去划分inorder和preorder。
用递归，终止条件是当preorder为空，返回空，preorder只含一个元素，返回包含该元素的叶子节点TreeNode。根据传入的preorder，inorder重复做一样的事，得到根节点和孩子节点。

class Solution:
    def buildTree(self, preorder: List[int], inorder: List[int]) -> TreeNode:
        if len(preorder) == 0:
            return 
        if len(preorder) == 1:
            return TreeNode(preorder[0])
        
        root = TreeNode(preorder[0])
        pos = inorder.index(root.val)
        if preorder[1:1+pos]:
            root.left = self.buildTree(preorder[1:1+pos], inorder[:pos])
        if preorder[1+pos:]:
            root.right = self.buildTree(preorder[1+pos:],inorder[pos+1:])
        return root

这段代码更复杂些，但是可以清楚看到preorder和inorder被分为四个部分，更好理解。

Class Solution:
    def buildTree(self, preorder: List[int], inorder: List[int]) -> TreeNode:
        if preorder == []:
            return 
        root = TreeNode(preorder[0])
        self.getRoot(preorder, inorder, root)
        return root
        
    def getRoot(self, preorder, inorder, root):
        if len(preorder) == 1:
            return 
        pos = inorder.index(root.val)
        leftInorder = inorder[:pos]
        rightInorder = inorder[pos+1:]
        leftPreorder = preorder[1:1+len(leftInorder)]
        rightPreorder = preorder[1+len(leftInorder):]
        if leftPreorder:
            root.left = TreeNode(leftPreorder[0])
            self.getRoot(leftPreorder, leftInorder, root.left)
        if rightPreorder:
            root.right = TreeNode(rightPreorder[0])
            self.getRoot(rightPreorder,rightInorder, root.right)

106题与本题一样，只不过改为提供inorder和postorder。
只需要把root = preorder[0]改为root = postorder[-1]

class Solution:
    def buildTree(self, inorder: List[int], postorder: List[int]) -> TreeNode:
        if len(postorder) == 0:
            return 
        if len(postorder) == 1:
            return TreeNode(postorder[-1])
        
        root = TreeNode(postorder[-1])
        pos = inorder.index(root.val)
        if postorder[:pos]:
            root.left = self.buildTree(inorder[:pos], postorder[:pos])
        if postorder[pos:len(postorder)-1]:
            root.right = self.buildTree(inorder[pos+1:], postorder[pos:len(postorder)-1])
        return root