Algorithms—108.Convert Sorted Array to Binary Search Tree

/**
* 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 build(nums,0,nums.length-1);
}
public TreeNode build(int[] nums,int s,int e){
if (s>e) {
return null;
}
int m=(s+e)/2;
int val=nums[m];
TreeNode node=new TreeNode(val);
node.left=build(nums,s,m-1);
node.right=build(nums,m+1,e);
return node;
}
}