首页
学习
活动
专区
工具
TVP
发布
社区首页 >专栏 >Tree - 109. Convert Sorted List to Binary Search Tree

Tree - 109. Convert Sorted List to Binary Search Tree

作者头像
ppxai
发布2020-09-23 17:28:38
3540
发布2020-09-23 17:28:38
举报
文章被收录于专栏:皮皮星球皮皮星球

109. Convert Sorted List to Binary Search Tree

Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.

For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.

Example:

Given the sorted linked list: [-10,-3,0,5,9],

One possible answer is: [0,-3,9,-10,null,5], which represents the following height balanced BST:

      0
     / \
   -3   9
   /   /
 -10  5

思路:

和108题一样都是把一些有序数据整理成bst,这里的数据结构是链表,做法和数组一样,找链表中点,用的都是快慢指针的办法,然后根据root分开成两个链表之后继续递归求解左右子树。

代码:

go:

/**

 * Definition for singly-linked list.
 * type ListNode struct {
 *     Val int
 *     Next *ListNode
 * }
 */
/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *     Val int
 *     Left *TreeNode
 *     Right *TreeNode
 * }
 */
func sortedListToBST(head *ListNode) *TreeNode {
    if head == nil {
        return nil
    }
    
    if head.Next == nil {
        return &TreeNode{Val:head.Val}
    }
    
    
    mid := findMid(head)
    root :=  &TreeNode{Val:mid.Val}
    
    root.Left = sortedListToBST(head)
    root.Right = sortedListToBST(mid.Next)
    
    return root 
    
}

// find list mid
func findMid(head *ListNode) *ListNode {
	var prev *ListNode
	slow, fast :=  head, head
    for fast != nil && fast.Next != nil {
        prev = slow
        slow = slow.Next
        fast = fast.Next.Next
    }
    prev.Next = nil // partition list
    return slow
}
本文参与 腾讯云自媒体分享计划,分享自作者个人站点/博客。
原始发表:2019年08月28日,如有侵权请联系 cloudcommunity@tencent.com 删除

本文分享自 作者个人站点/博客 前往查看

如有侵权,请联系 cloudcommunity@tencent.com 删除。

本文参与 腾讯云自媒体分享计划  ,欢迎热爱写作的你一起参与!

评论
登录后参与评论
0 条评论
热度
最新
推荐阅读
领券
问题归档专栏文章快讯文章归档关键词归档开发者手册归档开发者手册 Section 归档