Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Physics
Chemistry
Biology
Mathematics
English
Economics
Psychology
Social Studies
Fashion Studies
Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Golang Program to delete the last node from a linked list.
Examples
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
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 DeleteLastNode(head *Node) *Node{
if head == nil{
return head
}
temp := head
for temp.next.next != nil{
temp = temp.next
}
temp.next = nil
return head
}
func main(){
head := NewNode(30, NewNode(10, NewNode(40, NewNode(40, nil))))
fmt.Printf("Input Linked list is: ")
TraverseLinkedList(head)
head = DeleteLastNode(head)
fmt.Printf("After deleting last node of the linked list: ")
TraverseLinkedList(head)
}Output
Input Linked list is: 30 10 40 40 After deleting last node of the linked list: 30 10 40
Updated on: 18-Mar-2021
295 Views
Advertisements