【leetcode】108. Convert Sorted Array to Binary Search Tree

题目要求：

Given an array where elements are sorted in ascending order, convert it to a height balanced BST.

给定一个排好序的数组，要求转换成二叉搜索树

思路：数组中间的元素作为树的根节点，左边的元素是左子树，右边的元素是右子树，递归建立左右子树

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public TreeNode sortedArrayToBST(int[] nums) {
        return createSearchTree(nums,0,nums.length-1);
    }
    
    public TreeNode createSearchTree(int[] nums,int start,int end)
    {
        
        if(start<=end)
        {int mid = (start+end)/2;
         TreeNode node = new TreeNode(nums[mid]);
        node.left=createSearchTree(nums,start,mid-1);
        node.right=createSearchTree(nums,mid+1,end); 
         return node;
        }
       
       return null;
       
    }
}