Back to Repositories

Testing Linked List Operations Implementation in Hello-Algo

A comprehensive Go test suite that validates linked list operations in the Hello-Algo repository. This test file verifies core linked list functionality including initialization, insertion, deletion, access, and node searching operations.

Test Coverage Overview

The test suite provides thorough coverage of essential linked list operations:

Node initialization and linking
Node insertion functionality
Node removal operations
Index-based node access
Value-based node search

Edge cases and basic linked list operations are validated through a structured test flow.

Implementation Analysis

The testing approach utilizes Go’s native testing framework with a single comprehensive test function (TestLinkedList). The implementation follows Go’s testing conventions and demonstrates clear state verification through fmt.Println statements for visual inspection of list modifications.

The test structure implements a practical example of linked list manipulation with actual data structures.

Technical Details

Testing tools and configuration:

Go testing package (testing)
Custom package imports from hello-algo/pkg
ListNode structure implementation
Print utilities for linked list visualization
Standard Go test execution environment

Best Practices Demonstrated

The test exhibits several quality testing practices:

Clear test case organization with distinct operation sections
Proper test function naming conventions
Visual result verification through structured output
Comprehensive operation validation
Clean and maintainable test structure

krahets/hello-algo

zh-hant/codes/go/chapter_array_and_linkedlist/linked_list_test.go

            
// File: linked_list_test.go
// Created Time: 2022-12-29
// Author: cathay ([email protected])

package chapter_array_and_linkedlist

import (
	"fmt"
	"testing"

	. "github.com/krahets/hello-algo/pkg"
)

func TestLinkedList(t *testing.T) {
	/* 初始化鏈結串列 1 -> 3 -> 2 -> 5 -> 4 */
	// 初始化各個節點
	n0 := NewListNode(1)
	n1 := NewListNode(3)
	n2 := NewListNode(2)
	n3 := NewListNode(5)
	n4 := NewListNode(4)

	// 構建節點之間的引用
	n0.Next = n1
	n1.Next = n2
	n2.Next = n3
	n3.Next = n4
	fmt.Println("初始化的鏈結串列為")
	PrintLinkedList(n0)

	/* 插入節點 */
	insertNode(n0, NewListNode(0))
	fmt.Println("插入節點後的鏈結串列為")
	PrintLinkedList(n0)

	/* 刪除節點 */
	removeItem(n0)
	fmt.Println("刪除節點後的鏈結串列為")
	PrintLinkedList(n0)

	/* 訪問節點 */
	node := access(n0, 3)
	fmt.Println("鏈結串列中索引 3 處的節點的值 =", node)

	/* 查詢節點 */
	index := findNode(n0, 2)
	fmt.Println("鏈結串列中值為 2 的節點的索引 =", index)
}