LeetCode: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 {    TreeNode creatTree(int[] num,int low,int hight)    {        if(low<=hight)        {            int mid=(low+hight)/2;            TreeNode p=new TreeNode(num[mid]);            p.left=creatTree(num,low,mid-1);            p.right=creatTree(num,mid+1,hight);            return p;        }        return null;    }    public TreeNode sortedArrayToBST(int[] num) {        if(num.length==0)return null;        return creatTree(num,0,num.length-1);    }}