-
Notifications
You must be signed in to change notification settings - Fork 2
/
q0108.c
72 lines (65 loc) · 1.54 KB
/
q0108.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
//
// q0108.c
// LeetCode
//
// Created by NowOrNever on 30/10/2019.
// Copyright © 2019 DoubleL. All rights reserved.
//
#include "q0108.h"
#include "../common.h"
//108. Convert Sorted Array to Binary Search Tree
//Easy
//
//1500
//
//153
//
//Favorite
//
//Share
//Given an array where elements are sorted in ascending order, convert it to a height balanced BST.
//
//For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.
//
//Example:
//
//Given the sorted array: [-10,-3,0,5,9],
//
//One possible answer is: [0,-3,9,-10,null,5], which represents the following height balanced BST:
//
// 0
// / \
// -3 9
// / /
// -10 5
//Accepted
//310,471
//Submissions
//582,351
/**
* 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;
}else if (numsSize == 1){
struct TreeNode* newNode = calloc(1, sizeof(struct TreeNode));
newNode->val = nums[0];
return newNode;
}else{
int middle = numsSize / 2;
struct TreeNode* newNode = calloc(1, sizeof(struct TreeNode));
newNode->val = nums[middle];
newNode->left = sortedArrayToBST(nums, middle);
newNode->right = sortedArrayToBST(nums + middle + 1, numsSize - middle - 1);
return newNode;
}
}
int question108(){
return 0;
}