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

解题的方法也是递归，以链表的中点为根节点，左边元素为根节点的左子树节点，右边元素为链表右子树节点，再对左边元素和右边元素递归操作。

/**
 * 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) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        return sortedListToBST(head, NULL);
    }
private:
    TreeNode* sortedListToBST(ListNode *head, ListNode *tail) {
        if (head == tail)
            return NULL;
            
        if (head->next == tail)
            return new TreeNode(head->val);
            
        ListNode *p1, *p2;
        p1 = p2 = head;
        
        while (p2!=tail && p2->next!=tail) {    //p1每次走一步，p2每次走2步，最终p1指向中点
            p1 = p1->next;
            p2 = p2->next->next;
        }
        
        TreeNode *root = new TreeNode(p1->val);
        
        root->left = sortedListToBST(head, p1);
        root->right = sortedListToBST(p1->next, tail);
        
        return root;
    }
};