Back to Repositories

Testing Binary Tree Operations in hello-algo

This test suite validates binary tree operations in Go, focusing on initialization, node manipulation, and tree structure verification. The tests ensure proper implementation of basic binary tree functionality including node creation, insertion, and deletion operations.

Test Coverage Overview

The test coverage encompasses core binary tree operations including node initialization, tree construction, and node manipulation.

Tests node creation and initialization with various values
Validates tree structure through pointer references
Verifies node insertion and deletion operations
Ensures proper parent-child relationships

Implementation Analysis

The testing approach utilizes Go’s native testing framework with a focus on structural validation and visual verification.

Implementation leverages custom tree node structures and helper functions from the hello-algo package, particularly PrintTree for visual validation. The test demonstrates both programmatic and visual verification patterns.

Technical Details

Testing Framework: Go testing package
Custom Utilities: PrintTree visualization function
Node Structure: Custom TreeNode implementation
Dependencies: hello-algo/pkg package

Best Practices Demonstrated

The test suite exemplifies clean testing practices with clear setup and verification steps.

Structured test organization with distinct operational phases
Visual feedback for tree structure verification
Comprehensive node relationship testing
Clear separation of initialization and manipulation tests

krahets/hello-algo

codes/go/chapter_tree/binary_tree_test.go

            
// File: binary_tree_test.go
// Created Time: 2022-11-25
// Author: Reanon ([email protected])

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)
}