将排序的数组转换成二叉搜索树

给定一组递增的数，将其转换成BST

public static TreeNode SortedArrayToBST(int[] nums)
        {
            return SortedArrayToBST(nums, 0, nums.Length);
        }

        private static TreeNode SortedArrayToBST(int[]nums,int begin,int end)
        {
            int length = end - begin;
            if (length < 1) return null;
            int mid = begin + length / 2;
            TreeNode root = new TreeNode(nums[mid]);
            root.Left = SortedArrayToBST(nums, begin, mid);
            root.Right = SortedArrayToBST(nums, mid + 1, end);
            return root;
        }