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

Optimize arrToTree function

Browse Source 
in java, cpp, py, go, js, ts.
This commit is contained in:
Yudong Jin
2023-01-08 19:03:22 +08:00
parent c411969bd1
commit dcc3b2e35b
29 changed files with 222 additions and 114 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
codes/go/chapter_tree/binary_tree_dfs_test.go
View File

@@ -14,22 +14,22 @@ import (
func TestPreInPostOrderTraversal(t *testing.T) {
/* 初始化二叉树 */
// 这里借助了一个从数组直接生成二叉树的函数
root := ArrayToTree([]int{1, 2, 3, 4, 5, 6, 7})
fmt.Println("初始化二叉树: ")
root := ArrToTree([]int{1, 2, 3, 4, 5, 6, 7})
fmt.Println("\n初始化二叉树: ")
PrintTree(root)
// 前序遍历
nums = nil
preOrder(root)
fmt.Println("前序遍历的结点打印序列 =", nums)
fmt.Println("\n前序遍历的结点打印序列 =", nums)
// 中序遍历
nums = nil
inOrder(root)
fmt.Println("中序遍历的结点打印序列 =", nums)
fmt.Println("\n中序遍历的结点打印序列 =", nums)
// 后序遍历
nums = nil
postOrder(root)
fmt.Println("后序遍历的结点打印序列 =", nums)
fmt.Println("\n后序遍历的结点打印序列 =", nums)
}