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.

Similar method with Convert Sorted Array to Binary Search Tree. 

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; next = null; }
 * }
 */
/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public TreeNode sortedListToBST(ListNode head) {
        if (head == null) {
            return null;
        }
        
        ListNode start = head;
        ListNode end = head;
        while (end != null && end.next != null) {
            end = end.next;
        }
        return buildBST(start, end);
    }
    
    private TreeNode buildBST(ListNode start, ListNode end) {
        if (start == end) {
            return new TreeNode(start.val);
        }
        
        
        ListNode head = start;
        ListNode premid = start, mid = start;
        while (head != end && head.next != end) {
            head = head.next.next;
            premid = mid;
            mid = mid.next;
        }
        
        TreeNode node = new TreeNode(mid.val);
        if (start == mid) {
            node.left = null;
        } else {
            node.left = buildBST(start, premid);
        }
        if (mid == end) {
            node.right = null;
        } else {
            node.right = buildBST(mid.next, end);
        }
        return node;
    }
}