LeetCode109：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.

For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.

Example:

Given the sorted linked list: [-10,-3,0,5,9],

One possible answer is: [0,-3,9,-10,null,5], which represents the following height balanced BST:

      0
     / \
   -3   9
   /   /
 -10  5

---

LeetCode：链接

将有序链表转换成平衡二叉树。

采用递归的思想，寻找中点构造二叉搜索树，左子树和右子树分别递归即可，注意递归停止的条件：无结点或者只有一个叶子结点 。注意：无结点时返回自身，但有一个结点的时候，应该返回该节点构成的二叉搜索树，否则返回的自身为链表会报错 。

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.next = None

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution(object):
    def sortedListToBST(self, head):
        """
        :type head: ListNode
        :rtype: TreeNode
        """
        if not head:
            return head
        if not head.next:
            return TreeNode(head.val)
        preslow = slow = fast = head
        while fast and fast.next:
            preslow = slow
            slow = slow.next
            fast = fast.next.next
        preslow.next = None
        root = TreeNode(slow.val)
        root.left = self.sortedListToBST(head)
        root.right = self.sortedListToBST(slow.next)
        return root