My  C solution with  recursion,7ms
struct TreeNode* convert(int* nums,int start,int end)\n    {\n         if(start > end)\n              return NULL;\n         else{\n             int mid = (star
    struct TreeNode* convert(int* nums,int start,int end)\n    {\n         if(start > end)\n              return NULL;\n         else{\n             int mid = (start+end)/2;\n             struct TreeNode* node = (struct TreeNode*)malloc(sizeof(struct TreeNode));\n             node->val = nums[mid];\n             node->left = convert(nums,start,mid-1);\n             node->right = convert(nums,mid+1,end);\n             return node;\n         }\n    }\n \n\n    struct TreeNode* sortedArrayToBST(int* nums, int numsSize) {\n            return convert(nums,0,numsSize-1);\n    }
[]