[108] Convert Sorted Array to Binary Search Tree

今天狀況好糟～（吶喊臉）

我該怎麼辦QQ

/**

* Definition for a binary tree node.

* struct TreeNode {

* int val;

* struct TreeNode *left;

* struct TreeNode *right;

* };

*/

struct TreeNode* iteration (int* nums, int left, int right){

if (left>=right)

return NULL;

int mid = left+ (right-left)/2;

struct TreeNode* ptr = malloc (sizeof(struct TreeNode));

ptr->val = nums[mid];

ptr->left = iteration(nums,left,mid);

ptr->right = iteration(nums,mid+1,right);

return ptr;

}

struct TreeNode* sortedArrayToBST(int* nums, int numsSize){

return iteration(nums,0,numsSize);

}