牛客题霸 NC11 将升序数组转化为平衡二叉搜索树

Posted 2021-09-04 Starzkg

https://www.nowcoder.com/practice/7e5b00f94b254da599a9472fe5ab283d

解决方案

Go

func sortedArrayToBST(num []int) *TreeNode {
	// write code here
	return preOrder(num, 0, len(num)-1)
}

func preOrder(num []int, left, right int) *TreeNode {
	if left > right {
		return nil
	}
	mid := left + (right-left+1)/2
	root := &TreeNode{
		Val:   num[mid],
		Left:  preOrder(num, left, mid-1),
		Right: preOrder(num, mid+1, right)}
	return root
}

参考文章