给定一个单链表,其中的元素按升序排序,将其转换为高度平衡的二叉搜索树。
本题中,一个高度平衡二叉树是指一个二叉树每个节点 的左右两个子树的高度差的绝对值不超过 1。
示例:
给定的有序链表: [-10, -3, 0, 5, 9],
一个可能的答案是:[0, -3, 9, -10, null, 5], 它可以表示下面这个高度平衡二叉搜索树:
0
/ \
-3 9
/ /
-10 5
第一种麻瓜思路:
跟LeetCode-Python-108. 将有序数组转换为二叉搜索树基本相同,先转成数组就好。
# 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
"""
if not head:
return None
l = list()
while(head):
l.append(head.val)
head = head.next
def sortedArrayToBST(nums):
if not nums:
return None
def dfs(start, end):
if end < start:
return
mid = (end + start) // 2
root = TreeNode(nums[mid])
root.left = dfs(start, mid - 1)
root.right = dfs(mid + 1, end)
return root
return dfs(0, len(nums) - 1)
return sortedArrayToBST(l)
第二种思路:
用快慢指针找到链表的中点,然后递归建树。
class Solution(object):
def sortedListToBST(self, head):
"""
:type head: ListNode
:rtype: TreeNode
"""
if not head:
return None
if not head.next:
return TreeNode(head.val)
slow, fast = head, head
pre = head
while fast and fast.next:
pre = slow
slow = slow.next
fast = fast.next.next
# print slow.val, fast.val, pre.val
pre.next = None
part1 = head
part2 = slow.next
root = TreeNode(slow.val)
root.left = self.sortedListToBST(part1)
root.right = self.sortedListToBST(part2)
return root