有序链表转换二叉搜索树

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public TreeNode sortedListToBST(ListNode head) {
        //区间左闭又开既不包括最右边的节点，实际上是指整个链表
       return sortedListToBST_(head, null);    
    }

    public TreeNode sortedListToBST_(ListNode left, ListNode right){
        if(right == left){
           return null; 
        }
       //链表的中位数节点
       ListNode mid = MidInList(left, right);
       TreeNode root = new TreeNode(mid.val);
       root.left = sortedListToBST_(left, mid);
       root.right = sortedListToBST_(mid.next, right);
       return root;
    }
    
    //快慢指针解决中位数节点
    public ListNode MidInList(ListNode left, ListNode right){
        ListNode fast = left;
        ListNode slow = left;
        while(fast != right && fast.next != right){
            slow = slow.next;
            fast = fast.next.next;     
        }
        return slow;
    }
}