from structures import TreeNode, tree_values

def sorted_array_to_bst(nums):
    def build(left, right):
        if left == right:
            return None
        mid = (left + right) // 2
        return TreeNode(nums[mid], build(left, mid), build(mid + 1, right))
    return build(0, len(nums))