最简双向循环链表

/// <summary>
    /// circular doubly linked list
    /// 双向循环链表
    /// </summary>
    public class Node
    {
        public Node Pre;
        public Node Next;

        /// <summary>
        /// 因为循环，所以用的方法都是插入的
        /// </summary>
        /// <param name="last"></param>
        /// <returns></returns>
        public Node InsertNode(Node last)
        {
            var current = new Node();
            if (last == null)
            {
                current.Next = current;
                current.Pre = current;
                return current;
            }

            current.Next = last;
            current.Pre = last.Pre;
            last.Pre.Next = current;
            last.Pre = current;
            return current;
        }
    }