Learn Data Structures and Algorithms with Golang

The ReverseLinkedList method

The ReverseLinkedList function takes a node pointer, nodeList, and returns a node pointer to a reversed linked list.

The following code snippet shows how the linked list is reversed:

// Reverse List methodfunc ReverseLinkedList(nodeList *Node) *Node {    var currNode *Node    currNode = nodeList    var topNode *Node = nil    for {        if currNode == nil {            break        }        var tempNode *Node        tempNode = currNode.nextNode        currNode.nextNode = topNode        topNode = currNode        currNode = tempNode    }    return topNode}

The example output for the reverse linked list method is as follows. The method takes the parameter of a linked string starting from a to z. The reversed list is from z to a nodes: