## 题目地址

https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/

## 题目描述

Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.

For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.

Example:

``````Given the sorted linked list: [-10,-3,0,5,9],

One possible answer is: [0,-3,9,-10,null,5], which represents the following height balanced BST:

0
/ \
-3   9
/   /
-10  5
``````

## 代码

``````class Solution {
public:
while (fast->next && fast->next->next) {
last = slow;
slow = slow->next;
fast = fast->next->next;
}
fast = slow->next;
last->next = NULL;
TreeNode *cur = new TreeNode(slow->val);
cur->right = sortedListToBST(fast);
return cur;
}
};
``````

``````class Solution {
public:
}
TreeNode* helper(ListNode* head, ListNode* tail) {
if (head == tail) return NULL;
while (fast != tail && fast->next != tail) {
slow = slow->next;
fast = fast->next->next;
}
TreeNode *cur = new TreeNode(slow->val);
cur->right = helper(slow->next, tail);
return cur;
}
};
``````

评论
0 评论