问题描述:
给定一个单链表,其中的元素按照升序排列,将其转换为高度平衡的二叉搜索树。
问题分析:
本题与T108具有相同的意义,只是数据的存储结构改为了链表。(我们的做法是将链表转换为数组结构)
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode* sortedListToBST(ListNode* head) {
vector<int> v;
while(head!=nullptr)
{
v.push_back(head->val);
head = head->next;
}
return buildTree(v,0,v.size());
}
TreeNode* buildTree(vector<int>& v , int begin, int end)
{
if(begin ==end) return nullptr;
int mid = (begin+end)/2;
TreeNode* root = new TreeNode(v[mid]);
root->left = buildTree(v,begin,mid);
root->right = buildTree(v,mid+1,end);
return root;
}
};