链表的中间位置的元素

下面这道题来自LeetCode，记录这道题的意义在于：
1、如何找到链表中间位置的元素的方法；
2、平衡二叉查找树的构建的方法

题目：

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

注意： BST ( 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;
        if(head.next == null)
            return (new TreeNode(head.val));

        ListNode preMid = head;
        ListNode mid = head;
        ListNode end = head;
        //得到中间的位置！！！
        while(end!=null && end.next!=null){
            preMid = mid;
            mid = mid.next;
            end = end.next.next;
        }
        preMid.next = null;

        TreeNode headNode = new TreeNode(mid.val);
        headNode.left = sortedListToBST(head);
        headNode.right = sortedListToBST(mid.next);

        return headNode;

    }
}