```
def constructMaximumBinaryTree(self, nums):
"""
:type nums: List[int]
:rtype: TreeNode
"""
if len(nums) < 1:
return None
node = TreeNode(max(nums))
index = nums.index(node.val)
node.left = self.constructMaximumBinaryTree(nums[:index])
node.right = self.constructMaximumBinaryTree(nums[index+1:])
return node
```