109.有序链表转换二叉搜索树.go

/*
 * @lc app=leetcode.cn id=109 lang=golang
 *
 * [109] 有序链表转换二叉搜索树
 */

// @lc code=start
/**
 * 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
 * }
 */
 package main
 
 func main() {
	var a []int
	a = []int{-10,-3,0,5,9}	 
 }

func sortedListToBST(head *ListNode) *TreeNode {

}
// @lc code=end