mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-25 22:26:29 +08:00
e720aa2d24
* Sync recent changes to the revised Word. * Revised the preface chapter * Revised the introduction chapter * Revised the computation complexity chapter * Revised the chapter data structure * Revised the chapter array and linked list * Revised the chapter stack and queue * Revised the chapter hashing * Revised the chapter tree * Revised the chapter heap * Revised the chapter graph * Revised the chapter searching * Reivised the sorting chapter * Revised the divide and conquer chapter * Revised the chapter backtacking * Revised the DP chapter * Revised the greedy chapter * Revised the appendix chapter * Revised the preface chapter doubly * Revised the figures
41 lines
758 B
Go
41 lines
758 B
Go
// File: binary_tree_test.go
|
|
// Created Time: 2022-11-25
|
|
// Author: Reanon (793584285@qq.com)
|
|
|
|
package chapter_tree
|
|
|
|
import (
|
|
"fmt"
|
|
"testing"
|
|
|
|
. "github.com/krahets/hello-algo/pkg"
|
|
)
|
|
|
|
func TestBinaryTree(t *testing.T) {
|
|
/* 初始化二叉树 */
|
|
// 初始化节点
|
|
n1 := NewTreeNode(1)
|
|
n2 := NewTreeNode(2)
|
|
n3 := NewTreeNode(3)
|
|
n4 := NewTreeNode(4)
|
|
n5 := NewTreeNode(5)
|
|
// 构建节点之间的引用（指针）
|
|
n1.Left = n2
|
|
n1.Right = n3
|
|
n2.Left = n4
|
|
n2.Right = n5
|
|
fmt.Println("初始化二叉树")
|
|
PrintTree(n1)
|
|
|
|
/* 插入与删除节点 */
|
|
// 插入节点
|
|
p := NewTreeNode(0)
|
|
n1.Left = p
|
|
p.Left = n2
|
|
fmt.Println("插入节点 P 后")
|
|
PrintTree(n1)
|
|
// 删除节点
|
|
n1.Left = n2
|
|
fmt.Println("删除节点 P 后")
|
|
PrintTree(n1)
|
|
}
|