LC108 - 将有序数组转换为二叉搜索树

package BinaryTree

func sortedArrayToBST(nums []int) *TreeNode {
    size := len(nums)
    if size == 0 {
        return nil
    }
    root := new(TreeNode)
    root.Val = nums[size/2]
    root.Left = sortedArrayToBST(nums[:size/2])
    root.Right = sortedArrayToBST(nums[size/2+1:])
    return root
}