自定义队列C#的实现

队列的特点是先进先出，如同日常生活中的排队。队列有加入队尾，从队头删除元素，取得队尾元素，取得队头元素，取得队列长度，判断队列是否为空等操作。

下面，实现一个链队列

 /// <summary>
    /// 队列中的节点
    /// </summary>
    /// <typeparam name="T"></typeparam>
    public class MsgQueueNode<T>
    {
        internal T _value;
        internal MsgQueueNode<T> _next;

        public MsgQueueNode(T value)
        {
            _value = value;
            _next = null;
        }

        public T Value
        {
            get
            {
                return _value;
            }
            set
            {
                _value = value;
            }
        }
    }

    /// <summary>
    /// 自定义的消息队列
    /// </summary>
    /// <typeparam name="T"></typeparam>
    public class MsgQueue<T>
    {
        int _count;
        MsgQueueNode<T> _head;
        MsgQueueNode<T> _tail;

        public MsgQueue()
        {
            _count = 0;
            _head = _tail = null;
        }

        public void AddLast(T value)
        {
            AddLast(new MsgQueueNode<T>(value));
        }

        public void AddFirst(T value)
        {
            AddFirst(new MsgQueueNode<T>(value));
        }

        public void AddLast(MsgQueueNode<T> node)
        {
            if (null == _tail)
            {
                _head = node;
            }
            else
            {
                _tail._next = node;
            }
            node._next = null;
            _tail = node;
            _count++;
        }

        public void AddFirst(MsgQueueNode<T> node)
        {
            node._next = _head;
            _head = node;
            if (0 == _count++)
            {
                _tail = node;
            }
        }

        public void RemoveFirst()
        {
            _head = _head._next;
            if (0 == --_count)
            {
                _tail = null;
            }
        }

        public void Clear()
        {
            _count = 0;
            _head = _tail = null;
        }

        public IEnumerator<T> GetEnumerator()
        {
            MsgQueueNode<T> it = _head;
            while (null != it)
            {
                yield return it._value;
                it = it._next;
            }
            yield break;
        }

        public T[] ToList
        {
            get
            {
                int idx = 0;
                T[] list = new T[_count];
                MsgQueueNode<T> it = _head;
                while (null != it)
                {
                    list[idx++] = it._value;
                    it = it._next;
                }
                return list;
            }
        }

        public MsgQueueNode<T> First
        {
            get
            {
                return _head;
            }
        }

        public MsgQueueNode<T> Last
        {
            get
            {
                return _tail;
            }
        }

        public int Count
        {
            get
            {
                return _count;
            }
        }
    }

参考：

C#实现顺序队列_王大匣的博客-CSDN博客_c# queue 排序