mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-26 02:36:28 +08:00
31 lines
705 B
Go
31 lines
705 B
Go
|
// File: binary_tree_dfs_test.go
|
||
|
|
// Created Time: 2022-11-26
|
||
|
|
// Author: Reanon (793584285@qq.com)
|
||
|
|
|
||
|
|
package chapter_tree
|
||
|
|
|
||
|
|
import (
|
||
|
|
. "github.com/krahets/hello-algo/pkg"
|
||
|
|
"testing"
|
||
|
|
)
|
||
|
|
|
||
|
|
func TestPreInPostOrderTraversal(t *testing.T) {
|
||
|
|
/* 初始化二叉树 */
|
||
|
|
// 这里借助了一个从数组直接生成二叉树的函数
|
||
|
|
root := ArrayToTree([]int{1, 2, 3, 4, 5, 6, 7})
|
||
|
|
t.Log("初始化二叉树: ")
|
||
|
|
PrintTree(root)
|
||
|
|
|
||
|
|
// 前序遍历
|
||
|
|
nums := preOrder(root)
|
||
|
|
t.Log("前序遍历的结点打印序列 = ", nums)
|
||
|
|
|
||
|
|
// 中序遍历
|
||
|
|
nums = inOrder(root)
|
||
|
|
t.Log("中序遍历的结点打印序列 = ", nums)
|
||
|
|
|
||
|
|
// 后序遍历
|
||
|
|
nums = postOrder(root)
|
||
|
|
t.Log("后序遍历的结点打印序列 = ", nums)
|
||
|
|
}
|