From 8d314b048ffe7b6e35312a904646a68230a88298 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Furkan=20T=C3=BCrkal?= <furkan.turkal@hotmail.com>
Date: Thu, 26 Oct 2017 18:50:55 +0300
Subject: [PATCH] added linked-list-reverse

---
 linked-list-reverse/linked-list-reverse.go | 101 +++++++++++++++++++++
 1 file changed, 101 insertions(+)

diff --git a/linked-list-reverse/linked-list-reverse.go b/linked-list-reverse/linked-list-reverse.go
index e69de29..cfa3527 100644
--- a/linked-list-reverse/linked-list-reverse.go
+++ b/linked-list-reverse/linked-list-reverse.go
@@ -0,0 +1,101 @@
+// ====================================================
+// Data-Structures-with-Go Copyright(C) 2017 Furkan Türkal
+// This program comes with ABSOLUTELY NO WARRANTY; This is free software,
+// and you are welcome to redistribute it under certain conditions; See
+// file LICENSE, which is part of this source code package, for details.
+// ====================================================
+
+package main
+
+import "fmt"
+
+type Node struct {
+	data int
+	next *Node
+}
+
+//Returns an initialized list
+func (n *Node) Init() *Node {
+	n.data = -1
+	return n
+}
+
+//Returns an new list
+func New() *Node {
+	return new(Node).Init()
+}
+
+//Returns the first node in list
+func (n *Node) Next() *Node {
+	return n.next
+}
+  
+//Returns the last node in list if exist, otherwise returns current
+func (n *Node) Back() *Node {
+	current := n.next
+	for current != nil && current.next != nil {
+		current = current.next
+	}
+	return current
+}
+
+func Push(head_ref **Node, new_data int) {
+	//new_node := Node{data: new_data, next: (*head_ref)}
+	//*head_ref = new_node
+
+	//1. Allocate new node
+	new_node := New()
+
+	//2. Put in the data
+	new_node.data = new_data
+
+	//3. Make next of new node as head
+	new_node.next = (*head_ref)
+
+	//4. Move the head to point to new_node
+	*head_ref = new_node
+}
+
+func Reverse(head_ref **Node) {
+	prev := New()
+	current := *head_ref
+	next := New()
+
+	for(current != nil){
+		next = current.next
+		current.next = prev
+		prev = current
+		current = next
+	}
+
+	*head_ref = prev
+}
+
+//This function prints contents of linked list starting from the given node
+func printList(n *Node){
+	for n != nil {
+		fmt.Println(n.data)
+		n = n.next
+	}
+}
+
+func main() {
+	//Start with the empty list
+	head := New()
+	
+	Push(&head, 20)
+
+	Push(&head, 4)
+
+	Push(&head, 15)
+
+	Push(&head, 85)
+
+	fmt.Println("Given LinkedList is:")
+	printList(head)
+
+	Reverse(&head)
+
+	fmt.Println("Reversed LinkedList is:")
+	printList(head)
+}
\ No newline at end of file