[LeetCode] Convert Sorted List to Binary Search Tree

/**
 * 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 *build(ListNode *&head, int start, int end) {
        if (start > end) return NULL;
        
        int mid = start + (end - start) / 2;
        
        TreeNode *left = build(head, start, mid - 1);
        TreeNode *parent = new TreeNode(head->val);
        
        head = head->next;
        
        parent->left = left;
        parent->right = build(head, mid + 1, end);
        
        return parent;
    }
    
    TreeNode *sortedListToBST(ListNode *head) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int n = 0;
        for (ListNode *iter = head; iter; iter = iter->next, n++);
        
        return build(head, 0, n - 1);
    }
};

Small Case: 4ms

Large Case: 144ms

Time: O(n)

Space: O(1)

O(n) 的算法不容易想，参考了官网Blog. 注意到BST的中序遍历即有序序列，想办法如何构建中序遍历。其中遍历函数的引用传的太妙了。