added linked-list-3

linked-list-1-introduction/linked-list-1-introduction.go

@@ -39,6 +39,7 @@ func (n *Node) Back() *Node {
 	return current
 }
 
+//This function prints contents of linked list starting from the given node
 func printList(n *Node){
 	for n != nil {
 		fmt.Println(n.data)

linked-list-2-inserting-a-node/linked-list-2-inserting-a-node.go

@@ -104,6 +104,7 @@ func Append(head_ref **Node, new_data int) {
 	return
 }
 
+//This function prints contents of linked list starting from the given node
 func printList(n *Node){
 	for n != nil {
 		fmt.Println(n.data)

linked-list-3-deleting-a-node/linked-list-3-deleting-a-node.go

@@ -0,0 +1,118 @@
+// ====================================================
+// 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 DeleteNode(head_ref **Node, key int) {
+	//Store head node
+	temp := *head_ref
+	prev := *head_ref
+
+	//If head node itself holds the key to be deleted
+	if(temp != nil && temp.data == key){
+		*head_ref = temp.next;
+		temp = nil
+		return
+	}
+
+	//Search for the key to be deleted, keep track of the previous node as we need to change prev->next
+	for(temp != nil && temp.data != key){
+		prev = temp
+		temp = temp.next
+	}
+
+	// If key was not present in linked list
+	if(temp == nil){
+		return
+	}
+
+	//Unlink the node from linked list
+	prev.next = temp.next
+
+	temp = nil
+}
+
+//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, 7)
+
+	Push(&head, 1)
+
+	Push(&head, 3)
+
+	Push(&head, 2)
+
+	fmt.Println("Created LinkedList is: ")
+
+	printList(head)
+
+	DeleteNode(&head, 1)
+
+	fmt.Println("LinkedList after Deletion of 1: ")
+
+	printList(head)
+}