LC109. 有序链表转换二叉搜索树-CSDN博客

本文链接：https://blog.csdn.net/weixin_44392348/article/details/125192652

普通递归建树

def sortedListToBST(self, head):
        """
        :type head: Optional[ListNode]
        :rtype: Optional[TreeNode]
        """
        def getmid(left,right):                                 #找中位数
            slow = fast= left
            while fast != right and fast.next != right:  #奇数时就是fast本身，偶数时是fast.next相当于向下取整
                fast = fast.next.next
                slow = slow.next
            return slow
        def build(left,right):
            if left == right:                  #由于是左闭右开，所以相等时返回
                return 
            mid = getmid(left,right)
            root = TreeNode(mid.val)
            root.right = build(mid.next,right)  #采用左闭右开
            root.left = build(left,mid)
            return root                         #注意这里返回
        return build(head,None)                 #所以这里是left到None

递的时候建树，归的时候给节点传值。中序位置就是链表的顺序

def sortedListToBST(self, head):
        """
        :type head: Optional[ListNode]
        :rtype: Optional[TreeNode]
        """
        res = 0
        self.h = head
        while head:
            res += 1
            head = head.next
        def build(left,right):
            if left == right:
                return 
            mid =left + (right-left)//2
            root = TreeNode()
            root.left = build(left,mid)
            root.val = self.h.val
            self.h = self.h.next
            root.right = build(mid+1,right)
            return root
        return build(0,res)