singly_linked_list.go

package main

import "fmt"

type Node struct {
    data interface{}
    next *Node
}

type SinglyLinkedList struct {
    head *Node
}

func (list *SinglyLinkedList) IsEmpty() bool {
    return list.head == nil
}

func (list *SinglyLinkedList) InsertAtHead(data interface{}) {
    new := &Node{data: data}
    if list.IsEmpty() {
        list.head = new
    } else {
        new.next = list.head
        list.head = new
    }
}

func (list *SinglyLinkedList) InsertAtTail(data interface{}) {
    new := &Node{data: data}
    if list.IsEmpty() {
        list.head = new
    } else {
        current := list.head
        for current.next != nil {
            current = current.next
        }
        current.next = new
    }
}

func (list *SinglyLinkedList) DeleteAtHead() {
    if list.IsEmpty() {
        fmt.Println("Linked list is empty. No node to delete.")
    } else {
        list.head = list.head.next
    }
}

func (list *SinglyLinkedList) DeleteAtTail() {
    if list.IsEmpty() {
        fmt.Println("Linked list is empty. No node to delete.")
    } else if list.head.next == nil {
        list.head = nil
    } else {
        current := list.head
        for current.next.next != nil {
            current = current.next
        }
        current.next = nil
    }
}

func (list *SinglyLinkedList) Display() {
    if list.IsEmpty() {
        fmt.Println("Linked list is empty.")
    } else {
        current := list.head
        for current != nil {
            fmt.Print(current.data, " ")
            current = current.next
        }
        fmt.Println()
    }
}

// Usage example:
func main() {
    linkedList := &SinglyLinkedList{}
    linkedList.InsertAtHead(5)
    linkedList.InsertAtHead(3)
    linkedList.InsertAtTail(7)
    linkedList.Display()  // Output: 3 5 7
    linkedList.DeleteAtHead()
    linkedList.DeleteAtTail()
    linkedList.Display()  // Output: 5
}