Golang Program to delete the first node from a linked list.
Example
Approach to solve this problem
Step 1 − Define a method that accepts the head of a linked list.
Step 2 − If head == nil, return the head.
Step 3 − Go to the next node and return the updated head.
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 DeleteFirstNode(head *Node) *Node{
if head == nil{
return head
}
newHead := head.next
head.next = nil
return newHead
}
func main(){
head := NewNode(30, NewNode(10, NewNode(40, NewNode(40, nil))))
fmt.Printf("Input Linked list is: ")
TraverseLinkedList(head)
head = DeleteFirstNode(head)
fmt.Printf("After deleting first node of the linked list: ")
TraverseLinkedList(head)
}Output
Input Linked list is: 30 10 40 40
After deleting first node of the linked list: 10 40 40
Published on 18-Mar-2021 06:02:59
