leetcode 66: Convert Sorted List to Binary Search Tree

Convert Sorted List to Binary Search Tree Oct 3 '12

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

/**
 * 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:
    TreeNode *sortedListToBST(ListNode *head) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if(head==nullptr) return nullptr;
        TreeNode* root = findmid(head, nullptr);
        return root;
    }
    
    TreeNode* findmid(ListNode * start, ListNode * end) {
        if(start==end) return nullptr;
        
        ListNode* mid = start;
        ListNode* probe = start;
        while(probe!=end && probe->next!=end) {
            mid = mid->next;
            probe = probe->next->next;
        }
        
        TreeNode* root = new TreeNode(mid->val);
        root->left = findmid(start, mid);
        root->right = findmid(mid->next, end);
        
        return root;
    }
};