Challenge 4 - Balanced Binary Search Tree
Given a sorted array of numbers, write a function to create a balanced binary search tree. A balanced BST has no more than one level of depth difference between the right and left sides of the tree.
Each value in the array a should correspond to a node value. The return value will be the root node of the balanced tree. An empty array should return null.
Input: