109. Convert Sorted List to Binary Search Tree（python）

Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.
题意：将有序单链表转换成二叉搜索树
思路：采用递归的思想，寻找中点构造二叉搜索树，左子树和右子树分别递归即可，注意递归停止的条件：无结点或者只有一个叶子结点
注意：无结点时返回自身，但有一个结点的时候，应该返回该节点构成的二叉搜索树，否则返回的自身为链表会报错
Runtime: 296 ms
思路二：自底向上，无递归，采用for 循环从小到大依次合并，两个排好再四个排再八个

# 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):
        if not head :
            return head
        if  not head.next:
            return TreeNode(head.val)
        dummy=ListNode(0)
        dummy.next=head
        slow=fast=dummy
        while fast.next and fast.next.next:
            slow=slow.next
            fast=fast.next.next
        root=TreeNode(slow.next.val)
        root.right=self.sortedListToBST(slow.next.next)
        slow.next=None
        root.left=self.sortedListToBST(dummy.next)
        return root