[LeetCode] Convert Sorted Array to Binary Search Tree

来源:互联网 发布:淘宝玩具专卖 编辑:程序博客网 时间:2024/04/17 05:17
TreeNode *sortedArrayToBST(vector<int> &num) {int n = num.size();int beg = 0, end = n-1;TreeNode* root = NULL;if(beg <= end) {int mid = (beg + end + 1)/2;root = new TreeNode(num[mid]);vector<int> left_num;for(int i = beg; i < mid; i++) {left_num.push_back(num[i]);}root->left = sortedArrayToBST(left_num);vector<int> right_num;for(int i = mid + 1; i <= end; i++) {right_num.push_back(num[i]);}root->right = sortedArrayToBST(right_num);}return root;       }

0 0