108. 将有序数组转换为二叉搜索树

题目：
将一个按照升序排列的有序数组，转换为一棵高度平衡二叉搜索树。

本题中，一个高度平衡二叉树是指一个二叉树每个节点 的左右两个子树的高度差的绝对值不超过 1。

示例：

解题思路：
链接：
https://leetcode-cn.com/problems/convert-sorted-array-to-binary-search-tree/solution/jiang-you-xu-shu-zu-zhuan-huan-wei-er-cha-sou-s-33/

代码试下：

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


struct TreeNode* ConstructionTree(int* nums, int left, int right)
{
    if (left > right) {
        return NULL;
    }
    int mid;
    if ((left + right) % 2 == 0) {
        mid = (left + right) / 2;
    } else {
        mid = (left + right) / 2 + 1;
    }

    struct TreeNode* root = (struct TreeNode*)malloc(sizeof(struct TreeNode));
    root -> val = nums[mid];
    root -> left = ConstructionTree(nums, left, mid - 1);
    root -> right = ConstructionTree(nums, mid + 1, right);

    return root;
}

struct TreeNode* sortedArrayToBST(int* nums, int numsSize){
    return ConstructionTree(nums, 0, numsSize - 1);
}