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 binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    
    public TreeNode toBST(int[] num, int start, int end){
        if(start > end) return null;
        int mid = (end + start) / 2;
        TreeNode parent = new TreeNode(num[mid]);
        parent.left = toBST(num, start, mid-1);
        parent.right = toBST(num, mid+1, end);
        return parent;
        
    }
    
    public TreeNode sortedArrayToBST(int[] num) {
        int size = num.length;
        return toBST(num, 0, size-1);
    }
}