Convert Sorted Array to Binary Search Tree

Given an integer array sorted in non-decreasing order, convert it to a height-balanced binary search tree (BST). A height-balanced BST is a binary tree in which the depth of the two subtrees of every node never differs by more than one.