Maximum Binary Tree

Build a binary tree from an array of distinct integers: the root is the maximum value, the left subtree is built from the part before it and the right subtree from the part after it, recursively. Print the tree in level-order with null for gaps (omit trailing nulls).

1 <= n <= 1000 0 <= nums[i] <= 1000