-
Notifications
You must be signed in to change notification settings - Fork 3
/
solution.go
51 lines (44 loc) · 891 Bytes
/
solution.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
package main
import (
"fmt"
)
//ListNode is a singly-linked list.
type ListNode struct {
Val int
Next *ListNode
}
//TreeNode is 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{head.Val, nil, nil}
}
mid := findMid(head)
root := &TreeNode{mid.Val, nil, nil}
root.Left = sortedListToBST(head)
root.Right = sortedListToBST(mid.Next)
return root
}
func findMid(head *ListNode) *ListNode {
slow := head
fast := head
var prev *ListNode
for fast != nil && fast.Next != nil {
prev = slow
slow = slow.Next
fast = fast.Next.Next
}
prev.Next = nil
return slow
}
func main() {
head := &ListNode{-10, &ListNode{-3, &ListNode{0, &ListNode{5, &ListNode{9, nil}}}}}
fmt.Println(sortedListToBST(head).Right)
}