Add Node at the End of a Given Linked List in Golang

Example

Next

Approach to solve this problem

Step 1 − Define a method that accepts the head of a linked list.

Step 2 − If head == nil, create a new node and return that node.

Step 3 − If head is not nil, traverse till the second last of the linked list.

Example

 Live Demo

package main
import "fmt"
type Node struct {
   value int
   next *Node
}
func NewNode(value int, next *Node) *Node{
   var n Node
   n.value = value
   n.next = next
   return &n
}
func TraverseLinkedList(head *Node){
   temp := head
   for temp != nil {
      fmt.Printf("%d ", temp.value)
      temp = temp.next
   }
   fmt.Println()
}
func AddNodeAtEnd(head *Node, data int) *Node{
   if head == nil{
      head = NewNode(data, nil)
      return head
   }
   temp := head
   for temp.next != nil {
      temp = temp.next
   }
   temp.next = NewNode(5, nil)
   return head
}
func main(){
   head := NewNode(30, NewNode(10, NewNode(40, NewNode(40, nil))))
   fmt.Printf("Input Linked list is: ")
   TraverseLinkedList(head)
   AddNodeAtEnd(head, 5)
   fmt.Printf("After adding node at end, linked list is: ")
   TraverseLinkedList(head)
}

Output

Input Linked list is: 30 10 40 40
After adding node at end, linked list is: 30 10 40 40 5