Simple queue implementation in golang

queue.go

package main

import "fmt"

type Queue struct {
	Head *Node
	Tail *Node
}

type Node struct {
	data int
	next *Node
}

func (q *Queue) Enqueue(element int) {
	newNode := Node{data: element}
	if q.Head == nil {
		q.Head = &newNode
		q.Tail = &newNode
		return
	}
	q.Tail.next = &newNode
	q.Tail = &newNode
}

func (q *Queue) Dequeue() {
	//investigate if garbage collector eliminate the actual head (i dont think so bcz still have a refence to next)
	q.Head = q.Head.next
}

func (q *Queue) Peek() int {
	return q.Head.data
}

func (q *Queue) Lookup(pos int) int {
	current := q.Head
	for i := 0; i < pos; i++ {
		current = current.next
	}
	return current.data
}

func (q *Queue) Display() {
	current := q.Head
	for current != nil {
		fmt.Printf(" %d <- ", current.data)
		current = current.next
	}
	fmt.Println()
}

func main() {
	q := Queue{}
	q.Enqueue(5)
	q.Enqueue(8)
	q.Enqueue(3)
	q.Enqueue(10)
	q.Display()
	q.Dequeue()
	q.Display()

	fmt.Println(q.Peek())
	fmt.Println(q.Lookup(1))
}