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.
 * 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) {
        int n = 0;
		ListNode p = head;
		while(p != null)
		{
			n++;
			p = p.next;
		}
		//then divide and conquer
		return Convert2BST(head, n);
    }
    
    TreeNode Convert2BST(ListNode head, int len)
	{
		if(head == null || len < 1) return null;
		int mid = len/2;
		TreeNode left = Convert2BST(head, mid);
		for(int i=0; i<mid; i++){
		    head = head.next;
		}
		TreeNode parent = new TreeNode(head.val);
		parent.left = left;
		parent.right = Convert2BST(head.next, len-mid-1);
		return parent;
	}
}