108. Convert an ordered array into a binary search tree

Give you an array of integers nums , Where elements have been Ascending array , Please turn it into a Highly balanced Binary search tree .

Highly balanced A binary tree is a tree that satisfies 「 The absolute value of the height difference between the left and right subtrees of each node does not exceed 1 」 Two fork tree .

Example 1：

Input ：nums = [-10,-3,0,5,9]
Output ：[0,-3,9,-10,null,5]
explain ：[0,-10,5,null,-3,null,9] Will also be considered the right answer ：

Example 2：

Input ：nums = [1,3]
Output ：[3,1]
explain ：[1,null,3] and [3,1] They're all highly balanced binary search trees .

Tips ：

1 <= nums.length <= 104
-104 <= nums[i] <= 104
nums Press Strictly increasing Sequential arrangement

/** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */


struct TreeNode* sortedArrayToBST(int* nums, int numsSize){
    
    if (numsSize <= 0) return NULL;
    int pos = numsSize / 2;
    struct TreeNode *root = (struct TreeNode*)malloc(sizeof(struct TreeNode));
    root->val = nums[pos];
    root->left = sortedArrayToBST(nums, pos);
    root->right = sortedArrayToBST(nums + pos + 1, numsSize - pos - 1);
    return root;
}