Convert Sorted List to Binary Search Tree leetcode

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

方法一：把链表里的元素放入数组，再进行查找

方法二：遍历链表，设置快慢指针，找到中间元素，将该元素作为根节点时间复杂度为O(NlgN)

万能的递归法，注意到有一点比较巧的是，由于单链表都是单向的。所以这里我的查找区间设置为左闭右开！这样就避免了去找mid节点的前一个节点

class Solution {
public:
    TreeNode *sortedListToBST(ListNode *head) {
        return create(head,nullptr);
    }
    TreeNode* create(ListNode* head, ListNode* tail) {
        if(head == tail)
        return nullptr;
        ListNode* fast = head;
        ListNode* slow = head;
        while(fast != tail && fast->next != tail) {
            fast = fast->next->next;
            slow = slow->next;
        }
        TreeNode* root = new TreeNode(slow->val);//不能直接将listnode指针赋值给treenode
            root->left = create(head,slow);
            root->right = create(slow->next,tail);
        return root;
    }
};