Go-根据单链表实现基础队列操作

单链表实现：https://blog.csdn.net/luyaran/article/details/119378365

队列代码片段如下：

/*
 *                    .::::.
 *                  .::::::::.
 *                 :::::::::::
 *             ..:::::::::::'
 *           '::::::::::::'
 *             .::::::::::
 *        '::::::::::::::..
 *             ..::::::::::::.		Utils:用单链表实现队列
 *           ``::::::::::::::::		Author:崔金朋
 *            ::::``:::::::::'        .:::.
 *           ::::'   ':::::'       .::::::::.
 *         .::::'      ::::     .:::::::'::::.
 *        .:::'       :::::  .:::::::::' ':::::.
 *       .::'        :::::.:::::::::'      ':::::.
 *      .::'         ::::::::::::::'         ``::::.
 *  ...:::           ::::::::::::'              ``::.
 * ```` ':.          ':::::::::'                  ::::..
 *  		           '.:::::'          			':'````..
 */

package main

func CreateQueue() *LinkedList {
	return CreateLinkedList()
}

func (l *LinkedList) PushQueue(val interface{}) {
	l.InsertNode(1, val)
}

func (l *LinkedList) PopQueue() interface{} {
	head := l.Head
	num := head.Next.Value
	head.Next = head.Next.Next
	return num
}

func (l *LinkedList) LengthQueue() int {
	return l.Length
}