algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-12-19 07:17:54 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #220 from Reanon/bugfix/fix-go-code-style

Browse Source 
style(go): fix go code style
This commit is contained in:
Yudong Jin
2023-01-09 02:16:12 +08:00
committed by GitHub
parent b0a173ccf0 0243957015
commit 5c943471c7
30 changed files with 412 additions and 380 deletions
Download Patch File Download Diff File Expand all files Collapse all files

17
codes/go/pkg/tree_node.go
View File

@@ -25,11 +25,12 @@ func NewTreeNode(v int) *TreeNode {
}
// ArrToTree Generate a binary tree given an array
func ArrToTree(arr []int) *TreeNode {
func ArrToTree(arr []any) *TreeNode {
if len(arr) <= 0 {
return nil
}
root := NewTreeNode(arr[0])
// TreeNode only accept integer value for now.
root := NewTreeNode(arr[0].(int))
// Let container.list as queue
queue := list.New()
queue.PushBack(root)
@@ -39,13 +40,17 @@ func ArrToTree(arr []int) *TreeNode {
node := queue.Remove(queue.Front()).(*TreeNode)
i++
if i < len(arr) {
node.Left = NewTreeNode(arr[i])
queue.PushBack(node.Left)
if arr[i] != nil {
node.Left = NewTreeNode(arr[i].(int))
queue.PushBack(node.Left)
}
}
i++
if i < len(arr) {
node.Right = NewTreeNode(arr[i])
queue.PushBack(node.Right)
if arr[i] != nil {
node.Right = NewTreeNode(arr[i].(int))
queue.PushBack(node.Right)
}
}
}
return root