-
Notifications
You must be signed in to change notification settings - Fork 3
/
solution.go
35 lines (30 loc) · 704 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
package main
import "fmt"
// TreeNode is a binary tree node
type TreeNode struct {
Val int
Left *TreeNode
Right *TreeNode
}
func sortedArrayToBST(nums []int) *TreeNode {
if nums == nil || len(nums) == 0 {
return nil
}
return constructBSTRecursive(nums, 0, len(nums)-1)
}
func constructBSTRecursive(nums []int, left int, right int) *TreeNode {
if left > right {
return nil
}
mid := left + (right-left)/2
var current TreeNode
current.Val = nums[mid]
current.Left = constructBSTRecursive(nums, left, mid-1)
current.Right = constructBSTRecursive(nums, mid+1, right)
return ¤t
}
func main() {
nums := []int{-10, -3, 0, 5, 9}
t := sortedArrayToBST(nums)
fmt.Println(t.Val)
}