forked from cpselvis/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsolution108.cpp
More file actions
45 lines (39 loc) · 864 Bytes
/
solution108.cpp
File metadata and controls
45 lines (39 loc) · 864 Bytes
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
/**
* Convert Sorted Array to Binary Search Tree
*
* cpselvis([email protected])
* September 25th, 2016
*/
#include<iostream>
#include<vector>
using namespace std;
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
class Solution {
public:
TreeNode* sortedArrayToBST(vector<int>& nums) {
return dfs(nums, 0, nums.size());
}
TreeNode* dfs(vector<int> &nums, int left, int right)
{
if (left > right)
{
return NULL;
}
int mid = (left + right) >> 1;
TreeNode *node = new TreeNode(nums[mid]);
node -> left = dfs(nums, left, mid - 1);
node -> right = dfs(nums, mid + 1, right);
return node;
}
};
int main(int argc, char **argv)
{
Solution s;
vector<int> vec({1, 2, 4, 5, 6 ,7 , 8});
s.sortedArrayToBST(vec);
}