Leetcode 109. 有序链表转换二叉搜索树(Python3)

109. 有序链表转换二叉搜索树

给定一个单链表，其中的元素按升序排序，将其转换为高度平衡的二叉搜索树。

本题中，一个高度平衡二叉树是指一个二叉树每个节点 的左右两个子树的高度差的绝对值不超过 1。

示例:

给定的有序链表： [-10, -3, 0, 5, 9],

一个可能的答案是：[0, -3, 9, -10, null, 5], 它可以表示下面这个高度平衡二叉搜索树：

      0
     / \
   -3   9
   /   /
 -10  5

---

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

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

class Solution:
    def sortedListToBST(self, head: ListNode) -> TreeNode:
        #先转换成数组，再创建二叉搜索树
        arr = []
        cur = head
        while cur:
            arr.append(cur.val)
            cur = cur.next
        return self.dfs(arr)
    
    def dfs(self,arr):
        if not arr:
            return
        m = len(arr) // 2
        root = TreeNode(arr[m])
        root.left = self.dfs(arr[:m])
        root.right = self.dfs(arr[m+1:])
        return root     

---

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

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

class Solution:
    def sortedListToBST(self, head: ListNode) -> TreeNode:
        #直接用链表操作
        if not head:
            return 
        return self.dfs(head,None)
    
    def dfs(self,start,end):
        fast = slow = start
        if start == end:
            return 
        while fast != end and fast.next != end:
            fast = fast.next.next
            slow = slow.next
        root = TreeNode(slow.val)
        root.left = self.dfs(start,slow)
        root.right = self.dfs(slow.next,end)
        return root