[654. Maximum Binary Tree]

654.py

class Solution(object):
    def constructMaximumBinaryTree(self, nums):
        """
        :type nums: List[int]
        :rtype: TreeNode
        """
        if len(nums) == 0:
            return None
        
        val = max(nums)
        max_idx = nums.index(val)
        leftNode = self.constructMaximumBinaryTree(nums[:max_idx])
        rightNode = self.constructMaximumBinaryTree(nums[max_idx+1:])
        
        node = TreeNode(val)
        node.left = leftNode
        node.right = rightNode
        
        return node