给定一个单链表,其中的元素按升序排序,将其转换为高度平衡的二叉搜索树。
本题中,一个高度平衡二叉树是指一个二叉树每个节点 的左右两个子树的高度差的绝对值不超过 1。
示例:
给定的有序链表: [-10, -3, 0, 5, 9],
一个可能的答案是:[0, -3, 9, -10, null, 5], 它可以表示下面这个高度平衡二叉搜索树:
0
/ \
-3 9
/ /
-10 5
解答
一种比较直接的做法是先将链表转成数组,再将数组转成二叉树
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
TreeNode* sortedListToBST(ListNode* head) {
vector<int> temp;
while(head){
temp.push_back(head->val);
head = head->next;
}
return helper(temp, 0, temp.size()-1);
}
TreeNode* helper(vector<int>& vec, int left, int right){
if(left>right) return nullptr;
int mid = left + (right - left) / 2;
TreeNode* root = new TreeNode(vec[mid]);
root->left = helper(vec, left, mid-1);
root->right = helper(vec, mid+1, right);
return root;
}
};
使用快慢指针寻找链表中间节点:
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
TreeNode* sortedListToBST(ListNode* head) {
if(!head){
return nullptr;
}
else if(!head->next){
TreeNode* temp = new TreeNode(head->val);
return temp;
}
// 快慢指针找到中间节点,链表长度为偶数时,定义中间节点为靠后那个
ListNode* pre = nullptr;
ListNode* cur = head;
ListNode* nex = head;
while(nex && nex->next){
pre = cur;
cur = cur->next;
nex = nex->next->next;
}
//将链表分成两部分
pre->next = nullptr;
TreeNode* root = new TreeNode(cur->val);
root->left = sortedListToBST(head);
root->right = sortedListToBST(cur->next);
return root;
}
};