```
def constructMaximumBinaryTree(self, nums):
dummy = TreeNode(None)
def d(root, nums):
if not nums:
return
i = nums.index(max(nums))
root.val = max(nums)
if nums[:i]:
root.left = TreeNode(None)
d(root.left, nums[:i])
if nums[i+1:]:
root.right = TreeNode(None)
d(root.right, nums[i+1:])
d(dummy, nums)
return dummy
```