leetcode[108]:Convert Sorted Array to Binary Search Tree

来源:互联网 发布:php 菜鸟教程 编辑:程序博客网 时间:2024/05/16 17:19

Convert Sorted Array to Binary Search Tree

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

/** * Definition for a binary tree node. * struct TreeNode { *     int val; *     struct TreeNode *left; *     struct TreeNode *right; * }; */struct TreeNode* sortedArrayToBST(int* nums, int numsSize) {    struct TreeNode* tmp;    if(numsSize==0) return NULL;    tmp=(struct TreeNode*)malloc(sizeof(struct TreeNode*));    tmp->val=nums[numsSize/2];    tmp->left=sortedArrayToBST(nums, numsSize/2);    if(numsSize%2==0) tmp->right=sortedArrayToBST(nums+numsSize/2+1, numsSize/2-1);    else  tmp->right=sortedArrayToBST(nums+numsSize/2+1, numsSize/2);    return tmp;}

折半,递归。

0 0
原创粉丝点击