/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode *sortedArrayToBST(vector<int> &num) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
return sortedArrayToBST(num, 0, num.size()-1);
}
TreeNode *sortedArrayToBST(vector<int> &num, int begin, int end)
{
if(begin > end) return NULL;
int mid = begin + (end - begin) / 2;
TreeNode *root = new TreeNode(num[mid]);
root->left = sortedArrayToBST(num, begin, mid-1);
root->right = sortedArrayToBST(num, mid+1, end);
return root;
}
};
[Leetcode]Convert Sorted Array to Binary Search Tree
最新推荐文章于 2020-08-07 10:05:40 发布