添加 0108.将有序数组转换为二叉搜索树 Golang版本

添加 0108.将有序数组转换为二叉搜索树 Golang版本
This commit is contained in:
X-shuffle
2021-06-19 15:32:30 +08:00
committed by GitHub
parent 4a33ef6a04
commit ed14cefdb1

View File

@ -258,6 +258,29 @@ class Solution:
Go
> 递归(隐含回溯)
```go
/**
* Definition for a binary tree node.
* type TreeNode struct {
* Val int
* Left *TreeNode
* Right *TreeNode
* }
*/
//递归(隐含回溯)
func sortedArrayToBST(nums []int) *TreeNode {
if len(nums)==0{return nil}//终止条件,最后数组为空则可以返回
root:=&TreeNode{nums[len(nums)/2],nil,nil}//按照BSL的特点从中间构造节点
root.Left=sortedArrayToBST(nums[:len(nums)/2])//数组的左边为左子树
root.Right=sortedArrayToBST(nums[len(nums)/2+1:])//数字的右边为右子树
return root
}
```
-----------------------