LinkedQueue的实现

来源：作者：出处：巧巧读书 2006-10-05 进入讨论组

关键词：

　　public class LinkedQueue
{
private class Node
{

                public object Data;
                public Node Link;
        }

        private Node front;
        private Node rear;

        public LinkedQueue()
        {
        }

        public bool IsEmpty
        {
                get
                {
                        return front == null;
                }
        }


        public bool IsFull
        {
                get
                {
                        Node p;

                        try
                        {
                                p = new Node();
                                return false;
                        }
                        catch
                        {
                                return true;
                        }
                }
        }

        public object First
        {
                get
                {
                        if(IsEmpty)
                        {
                                throw new Exception("Queue is empty.");
                        }

                        return front.Data;
                }
        }

        public object Last
        {
                get
                {
                        if(IsEmpty)
                        {
                                throw new Exception("Queue is empty.");
                        }

                        return rear.Data;
                }
        }

        public LinkedQueue Add(object x)
        {
                Node p;

                // create node for new element
                p = new Node();
                p.Data = x;
                p.Link = null;

                if(front != null) // queue not empty
                {
                        rear.Link = p;
     &n请保留地址 http://www.qqread.com/dotnet/y226574.html 进入讨论组讨论。