牛小飞《数据结构》3.6队列.pptVIP

* * * * * * * * * * * * * * * * * * 讨论-enQueue x p rear.next=p; p.next=rear.next; rear=p; a1 a2 a3 rear rear a3 rear rear 讨论-enQueue p.next=p; x p rear=p; EnQueue public void enQueue(AnyType x){ } Node p=new Node(x); else if(rear!=null ) {p.next=rear.next; rear.next=p; rear=p;} {p.next=p; rear=p;} a1 a2 a3 a3 rear L 讨论—deQueue a1 a2 a3 rear rear.next=p.next; p=rear.next; a2 a3 rear return p.data; p a3 rear rear rear=null 讨论—deQueue 只有一个节点时： deQueue public AnyType deQueue( ){ if( rear= =null) return null; //空表 p=rear.next; return deQueueVal; } deQueueVal=p.data; else rear.next=