You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
36 lines
756 B
36 lines
756 B
// File: binary_tree_dfs_test.go
|
|
// Created Time: 2022-11-26
|
|
// Author: Reanon (793584285@qq.com)
|
|
|
|
package chapter_tree
|
|
|
|
import (
|
|
"fmt"
|
|
"testing"
|
|
|
|
. "github.com/krahets/hello-algo/pkg"
|
|
)
|
|
|
|
func TestPreInPostOrderTraversal(t *testing.T) {
|
|
/* 初始化二元樹 */
|
|
// 這裡藉助了一個從陣列直接生成二元樹的函式
|
|
root := SliceToTree([]any{1, 2, 3, 4, 5, 6, 7})
|
|
fmt.Println("\n初始化二元樹: ")
|
|
PrintTree(root)
|
|
|
|
// 前序走訪
|
|
nums = nil
|
|
preOrder(root)
|
|
fmt.Println("\n前序走訪的節點列印序列 =", nums)
|
|
|
|
// 中序走訪
|
|
nums = nil
|
|
inOrder(root)
|
|
fmt.Println("\n中序走訪的節點列印序列 =", nums)
|
|
|
|
// 後序走訪
|
|
nums = nil
|
|
postOrder(root)
|
|
fmt.Println("\n後序走訪的節點列印序列 =", nums)
|
|
}
|