Python | Leetcode Python题解之第109题有序链表转换二叉搜索树

最新推荐文章于 2024-05-25 05:12:05 发布

Mopes__

最新推荐文章于 2024-05-25 05:12:05 发布

阅读量506

点赞数 14

分类专栏：分享文章标签： Python Leetcode 题解

本文链接：https://blog.csdn.net/Mopes__/article/details/139188118

版权

分享专栏收录该内容

242 篇文章 2 订阅

订阅专栏

题目：

题解：

class Solution:
    def sortedListToBST(self, head: ListNode) -> TreeNode:
        def getLength(head: ListNode) -> int:
            ret = 0
            while head:
                ret += 1
                head = head.next
            return ret
        
        def buildTree(left: int, right: int) -> TreeNode:
            if left > right:
                return None
            mid = (left + right + 1) // 2
            root = TreeNode()
            root.left = buildTree(left, mid - 1)
            nonlocal head
            root.val = head.val
            head = head.next
            root.right = buildTree(mid + 1, right)
            return root
        
        length = getLength(head)
        return buildTree(0, length - 1)