109. Convert Sorted List to Binary Search Tree

109. Convert Sorted List to Binary Search Tree
     Medium

737

55

Favorite

Share
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:

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

两种解法
一种解法是用双指针的问题，当时考虑过，但是觉得不可行，这个题目的双指针有个技巧，多一个尾指针的接口，刚开始接口设为nullptr,之后为每次的中间值

/**
 * 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) {
        if(head==nullptr) return nullptr;
    return sortedListToBST(head,nullptr);

}
    TreeNode* sortedListToBST(ListNode* head,ListNode *tail ) {
        ListNode* slow = head;
        ListNode* fast = head;
        if(head==tail) return nullptr;  //trick
        while(fast!=tail&&fast->next!=tail){
            fast = fast->next->next;
            slow = slow->next;
        }
        TreeNode* node = new TreeNode(slow->val);
        node->left = sortedListToBST(head,slow);
        node->right = sortedListToBST(slow->next,tail);
        return node;
    }
};

另外一种解法是一种自底向上的解法，因为这个题是链表，无法用下表访问，只能从头访问
自底向上的算法，运用了DFS，直接遍历到最左的叶子节点

/**
 * 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) {
    int len = 0;
    ListNode *p = head;
    while (p) {
        len++;
        p = p->next;
    }
    return sortedListToBST(head, 0, len - 1);
}
private:
    TreeNode* sortedListToBST(ListNode*& list, int start, int end) {
    if (start > end) return nullptr;
    int mid = start + (end - start) / 2;
    TreeNode *leftChild = sortedListToBST(list, start, mid - 1);
    TreeNode *parent = new TreeNode(list->val);
    parent->left = leftChild;
    list = list->next;
    parent->right = sortedListToBST(list, mid + 1, end);
    return parent;
    }
};