데이터 구조 작업에 Go 언어를 사용하는 방법은 무엇입니까?

type Stack []interface{}

func NewStack() Stack {
    return make(Stack, 0)
}

func (s *Stack) Push(value interface{}) {
    *s = append(*s, value)
}

func (s *Stack) Pop() (value interface{}) {
    if s.Len() > 0 {
        value = (*s)[s.Len()-1]
        *s = (*s)[:s.Len()-1]
        return
    }
    return nil
}

func (s *Stack) Len() int {
    return len(*s)
}

func (s *Stack) IsEmpty() bool {
    return s.Len() == 0
}

func (s *Stack) Peek() interface{} {
    if s.Len() > 0 {
        return (*s)[s.Len()-1]
    }
    return nil
}

type Queue struct {
    list *list.List
}

func NewQueue() *Queue {
    return &Queue{list: list.New()}
}

func (q *Queue) Push(value interface{}) {
    q.list.PushBack(value)
}

func (q *Queue) Pop() interface{} {
    if elem := q.list.Front(); elem != nil {
        q.list.Remove(elem)
        return elem.Value
    }
    return nil
}

func (q *Queue) Len() int {
    return q.list.Len()
}

func (q *Queue) IsEmpty() bool {
    return q.list.Len() == 0
}

func (q *Queue) Peek() interface{} {
    if elem := q.list.Front(); elem != nil {
        return elem.Value
    }
    return nil
}

type Node struct {
    Data interface{}
    Next *Node
}

type LinkedList struct {
    Head *Node
    Tail *Node
    Size int
}

func NewLinkedList() *LinkedList {
    return &LinkedList{nil, nil, 0}
}

func (l *LinkedList) PushBack(data interface{}) {
    node := &Node{Data: data}
    if l.Size == 0 {
        l.Head = node
        l.Tail = node
    } else {
        l.Tail.Next = node
        l.Tail = node
    }
    l.Size++
}

func (l *LinkedList) Remove(data interface{}) bool {
    if l.Size == 0 {
        return false
    }
    if l.Head.Data == data {
        l.Head = l.Head.Next
        l.Size--
        return true
    }
    prev := l.Head
    curr := l.Head.Next
    for curr != nil {
        if curr.Data == data {
            prev.Next = curr.Next
            if curr.Next == nil {
                l.Tail = prev
            }
            l.Size--
            return true
        }
        prev = curr
        curr = curr.Next
    }
    return false
}

func (l *LinkedList) Traverse() {
    curr := l.Head
    for curr != nil {
        fmt.Println(curr.Data)
        curr = curr.Next
    }
}

type IntHeap []int

func (h IntHeap) Len() int           { return len(h) }
func (h IntHeap) Less(i, j int) bool { return h[i] < h[j] }
func (h IntHeap) Swap(i, j int)      { h[i], h[j] = h[j], h[i] }

func (h *IntHeap) Push(x interface{}) {
    *h = append(*h, x.(int))
}

func (h *IntHeap) Pop() interface{} {
    old := *h
    n := len(old)
    x := old[n-1]
    *h = old[:n-1]
    return x
}

func main() {
    h := &IntHeap{2, 1, 5, 6, 3, 0, 8}
    heap.Init(h)
    heap.Push(h, -1)
    for h.Len() > 0 {
        fmt.Printf("%d ", heap.Pop(h))
    }
    fmt.Println()
}