leetcode之Convert Sorted List to Binary Search Tree

链表转平衡二叉搜索树

最新推荐文章于 2024-04-24 10:37:23 发布

原创最新推荐文章于 2024-04-24 10:37:23 发布 · 248 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#Convert Sorted List #python #depth-first search #递归 #leetcode

本文介绍了一种将有序链表转换为高度平衡二叉搜索树的方法。通过先将链表转换为数组，再利用数组递归构建平衡二叉搜索树。文章提供了完整的Python实现代码。

这道题的思路借鉴了将esorted array转换的思路。讲linked list转换为array。再来做。代码如下：

# 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
        """
        listofall = []
        while head:
            listofall.append(head.val)
            head = head.next
        def sortedArrayToBST(nums):
            length = len(nums)
            if length == 0:
                return None
            if length == 1:
                return TreeNode(nums[0])
            if length == 2:
                root = TreeNode(nums[0])
                root.right = TreeNode(nums[1])
            if length == 3:
                root = TreeNode(nums[1])
                root.left = TreeNode(nums[0])
                root.right = TreeNode(nums[2])
                return root
            root = TreeNode(nums[length / 2])
            root.left = sortedArrayToBST(nums[:length / 2])
            root.right = sortedArrayToBST(nums[length / 2 + 1:])
            return root
        return sortedArrayToBST(listofall)