（第7讲）利用双向链表实现双端队列、优先级队列（有序数组实现、有序链表实现）

双端队列：就是一个两端都是结尾的队列。队列的每一端都可以插入数据项和移除数据项，方法可以称为insertLeft()、 insertRight()、 deleteLeft() 、deleteRight()；如果严格禁止调用insertLeft()和 deleteLeft() （或禁止调用右端的操作），双端队列功能就和栈一样；如果禁止调用insertLeft()和deleteRight()方法（或相反的另一对方法），他的功能就和队列一样了。具体实现代码如下：

//双端队列
package com.five; 
public class DoubleQueueAPP { 
public static void main(String[] args) {
DoubleQueue queue = new DoubleQueue();
queue.insertLeft(11);
queue.insertLeft(33);
queue.display();
queue.insertRight(22);
queue.insertRight(44);
queue.display();
queue.deleteRight();
queue.display();
queue.deleteLeft();
queue.display(); 
} 
}
//结点类
class DoubleNode1{
public Object data;
public DoubleNode1 next;
public DoubleNode1 previous;
public DoubleNode1(Object data){
this.data = data;
next = null;
previous = null;
}
public DoubleNode1(){
this(null);
}
}
//双向链表类
class DoubleList1{
private DoubleNode1 head;
private DoubleNode1 rear;
public DoubleList1(){
head = null;
rear = null;
}
//判断是否为空
public boolean isEmpty(){
return (head ==null);
}
//遍历：从前往后
public void displayLeft(){
DoubleNode1 node = head;
while(node!= null){
System.out.print(node.data+" ");
node = node.next;
}
System.out.println();

}
//遍历：从后往前
public void displayRight(){
DoubleNode1 node = rear;
while(node!=null){
System.out.print(node.data+" ");
node = node.previous;
}
System.out.println();
}
//新增：在链表头插入
public void insertLeft(Object value){
DoubleNode1 newnode = new DoubleNode1(value);
if(isEmpty()){
rear = newnode;
}else{
head.previous = newnode;
}
newnode.next