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) {
        if(NULL==head) return NULL;
        int len = length(head);
        TreeNode *root=NULL;
        if(len==1) {
            root = createNode(head->val);
            return root;
        }
        int middle = len/2;
        ListNode *pre=middleNode(head,middle);
		ListNode *p=pre->next;
        root = createNode(p->val);
        ListNode *postHead=p->next;
		pre->next=NULL;
        p->next=NULL;
        root->left=sortedListToBST(head);
        root->right = sortedListToBST(postHead);
        return root;
    }
private:
    TreeNode *createNode(int val){
        return new TreeNode(val);
    }
    int length(ListNode *head){
        int len=0;
        while(head){
            ++len;
            head=head->next;
        }
        return len;
    }
    ListNode* middleNode(ListNode *head,int index){
        int i=0;
        ListNode *pre=NULL;
        while(i<index){
            pre=head;
            head=head->next;
            ++i;
        }
        return pre;
    }
};