[Problem]
Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.
[Solution]
Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.
[Solution]
/**说明:版权所有,转载请注明出处。 Coder007的博客
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
// build a BST from num[begin:end]
TreeNode *sortedArrayToBST(vector<int> &num, int begin, int end){
// invalid
if(begin > end)return NULL;
// build
int mid = begin + (end - begin)/2;
// build the left brunch
TreeNode *left = sortedArrayToBST(num, begin, mid-1);
// build the right brunch
TreeNode *right = sortedArrayToBST(num, mid+1, end);
// build a new sub tree
TreeNode *root = new TreeNode(num[mid]);
root->left = left;
root->right = right;
return root;
}
// build a BST from a sorted list
TreeNode *sortedListToBST(ListNode *head) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
// convert list to array
vector<int> num;
ListNode *p = head;
while(p != NULL){
num.push_back(p->val);
p = p->next;
}
// build BST
return sortedArrayToBST(num, 0, num.size()-1);
}
};