108. Convert Sorted Array to Binary Search Tree

108. Convert Sorted Array to Binary Search Tree
     Easy

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

For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.

Example:

Given the sorted array: [-10,-3,0,5,9],

One possible answer is: [0,-3,9,-10,null,5], which represents the following height balanced BST:

  0
 / \

-3 9
/ /
-10 5

class Solution {
public:
    TreeNode* sortedArrayToBST(vector<int>& nums) {
        if(nums.size()==0) return NULL;
        int len=nums.size();
        TreeNode* t=BST(NULL,nums,0,len-1);
        return t;
    }
    TreeNode* BST(TreeNode* t,vector<int>& nums, int l,int r)
    {//往空树中插入新结点并返回根结点
        if(l<=r)
        {
            int mid=(l+r)/2;
            t=find(t,nums[mid]);
            t->left=BST(t,nums,l,mid-1);
            t->right=BST(t,nums,mid+1,r);
            return t;
        }
        return NULL;
    }
    TreeNode* find(TreeNode* t,int x)
    {//寻找插入位置并建立新结点返回
        if(t==NULL)
        {
            TreeNode* bt=new TreeNode(x);
            return bt;
        }
        else if(t->val>=x) return find(t->left,x);
        else return find(t->right,x);
    }
};