func (q *Queue) Enqueue(bytes []byte) {
	if len(bytes) == 0 {
		return
	}
	node := &queueNode{data: &bytes}
	if q.length == 0 {
		q.front = node
		q.back = q.front
	} else {
		q.back.next = node
		q.back = node
	}
	q.length++
}
Enqueue adds the byte slice to the queue
package inet
type queueNode struct {
	next *queueNode
	data *[]byte
}
type Queue struct {
	front  *queueNode
	back   *queueNode
	length int
}