leetcode 109 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

给定一个排好序的链表,将其转换成平衡二叉搜索树,从题意讲,本题和108题很像,都是排好序的一系列元素转换成平衡点BST。可以直接搬运108题的套路，先将链表转成数组，再用该数组去转换，如果这样做的话，刷题岂不是太没意思了，总要搞点什么不同的吧。回想下108题的思路，其关键是找到数组的中间元素，本题也是一样，要找到链表的中间元素。可以借助快慢指针来实现，每次使用快慢指针找出中间元素，二叉树的左子树是从开始到中间元素构建的二叉树，右子树是从中间的下一个元素到结束构建的二叉树，如此递归即可。代码记录如下：

/**
 * 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) {
        return fastSlowBuild(head, NULL);
    }
    
    TreeNode* fastSlowBuild(ListNode* start, ListNode* end)
    {
        if(start == end)
        {
            return NULL;
        }
        ListNode* fast = start;
        ListNode* slow = start;
        while(fast != end && fast->next != end)
        {
            fast = fast->next->next;
            slow = slow->next;
        }
        TreeNode* node = new TreeNode(slow->val);
        node->left = fastSlowBuild(start, slow);
        node->right = fastSlowBuild(slow->next, end);
        return node;
    }
};