Reverse Single Linked List

recursive_reverse.go

//@ympons - https://play.golang.org/p/mNEabcyTVa
package main

import "fmt"

type Node struct {
	data int
	next *Node
}

func Reverse(head **Node, p *Node){
	if (p.next == nil) {
		*head = p
		return
	}
	Reverse(head, p.next)
	p.next.next = p
	p.next = nil
}

// 1 -> 2 -> 3 -> nil	
func Print(head *Node) {
	current := head
	for(current != nil) {
		fmt.Println(current .data)
		current = current .next
	}
}

func main() {
	head := &Node{1, &Node{2, &Node{3, nil}}}	
	Print(head)
	fmt.Println("Reverse")
	Reverse(&head, head)
	Print(head)
}