算法通关村——链表实现队列

public class Node
{
    public int data;
    public Node next;
    public Node(int data)
    {
        this.data = data;
    }
}
public class LinkQueue
{
    private Node front;
    private Node rear;
    private int size;
    public LinkQueue()
    {
        this.front = new Node(0);
        this.rear = new Node(0);
    }
    //入队
    public void push(int value)
    {
        Node newNode = new Node(value);
        Node temp = front;
        while (temp.next != null)
        {
            temp = temp.next;
        }
        temp.next = newNode;
        rear = newNode;
        size++;
    }

    //出队
    public int pull()
    {
        if (front.next == null)
        {
            Console.WriteLine("队列已空");
        }
        Node firstNode = front.next;
        front.next = firstNode.next;
        size--;
        return firstNode.data;
    }

    //遍历
    public void traverse()
    {
        Node temp = front.next;
        while (temp != null)
        {
            Console.WriteLine(temp.data + "\t");
            temp = temp.next;
        }
    }

    
    //测试main方法
    public static void Main(String[] args)
    {
        LinkQueue linkQueue = new LinkQueue();
        linkQueue.push(1);
        linkQueue.push(2);
        linkQueue.push(3);
        Console.WriteLine("第一个出队的元素为:" + linkQueue.pull());
        Console.WriteLine("队列中的元素为:");
        linkQueue.traverse();
    }
}