Balanced BST from sorted array

Given a sorted array of distinct integers, build a height-balanced binary search tree and return it as a level-order array (null for any missing child), where the chosen root of any subtree is the lower-middle element (for an even-length range, the left of the two middles). Trailing nulls beyond the last real node should be omitted. Return the level-order encoding.