Back to Repositories

Testing Linked List Node Reversal Implementations in JCSprout

This test suite validates the functionality of linked list node reversal algorithms in Java, covering multiple implementation approaches including iterative and recursive methods. The tests verify different scenarios of node manipulation and edge cases for a custom Node class implementation.

Test Coverage Overview

The test suite provides comprehensive coverage of linked list reversal operations:

Basic node reversal with multiple nodes
Single node reversal scenarios
Null input handling
Head insertion method testing
Recursive reversal implementation

Implementation Analysis

The testing approach utilizes JUnit to validate three distinct node reversal implementations:

Standard iterative reversal (reverseNode1)
Head insertion method (reverseNode)
Recursive approach (recNode)

Each method is tested with various node configurations to ensure robust functionality.

Technical Details

Testing infrastructure includes:

JUnit 4 testing framework
Custom Node class implementation
Generic type support (String nodes)
Static imports for Node class
Exception handling verification

Best Practices Demonstrated

The test suite exemplifies several testing best practices:

Systematic edge case coverage
Clear test method naming conventions
Independent test cases for each scenario
Proper test setup and initialization
Comprehensive algorithm validation

crossoverjie/jcsprout

src/test/java/com/crossoverjie/algorithm/ReverseNodeTest.java

            
package com.crossoverjie.algorithm;

import org.junit.Test;
import static com.crossoverjie.algorithm.ReverseNode.Node;

public class ReverseNodeTest {

    @Test
    public void reverseNode1() throws Exception {
        ReverseNode.Node<String> node4 = new Node<>("4",null) ;
        Node<String> node3 = new Node<>("3",node4);
        Node<String> node2 = new Node<>("2",node3);
        Node<String> node1 = new Node("1",node2) ;

        ReverseNode reverseNode = new ReverseNode() ;
        reverseNode.reverseNode1(node1);
    }

    @Test
    public void reverseNode12() throws Exception {

        Node<String> node1 = new Node("1",null) ;

        ReverseNode reverseNode = new ReverseNode() ;
        reverseNode.reverseNode1(node1);
    }

    @Test
    public void reverseNode13() throws Exception {

        Node<String> node1 = null ;

        ReverseNode reverseNode = new ReverseNode() ;
        reverseNode.reverseNode1(node1);
    }


    /**
     * 头插法
     * @throws Exception
     */
    @Test
    public void reverseHead21() throws Exception {
        Node<String> node4 = new Node<>("4",null) ;
        Node<String> node3 = new Node<>("3",node4);
        Node<String> node2 = new Node<>("2",node3);
        Node<String> node1 = new Node("1",node2) ;

        ReverseNode reverseNode = new ReverseNode() ;
        reverseNode.reverseNode(node1);

    }


    @Test
    public void recNodeTest31(){
        Node<String> node4 = new Node<>("4",null) ;
        Node<String> node3 = new Node<>("3",node4);
        Node<String> node2 = new Node<>("2",node3);
        Node<String> node1 = new Node("1",node2) ;

        ReverseNode reverseNode = new ReverseNode() ;
        reverseNode.recNode(node1);
    }

}