栈和队列（使用链表实现）

1.栈

import java.util.Iterator;
public class Stack<Item> implements Iterable<Item>{
    private int N;
    private Node first;
    private class Node
    {
        Node next;
        Item item;
    }
    //实现一个迭代器
    private class StackIterator implements Iterator<Item>{
        private Node current = first;
        public void remove(){}
        public boolean hasNext(){
            return first != null;
        }
        //获取下一个元素
        public Item next(){
            Item item = current.item;
            current = current.next;
            return item;
        }
    }
    //获得迭代器
    public Iterator<Item> iterator(){
        return new StackIterator();
    }
    public boolean isEmpty(){
        return N == 0;
    }
    public int size(){
        return N;
    }
    public void push(Item item){
        Node oldfirst = first;
        first = new Node();
        first.item = item;
        first.next = oldfirst;
        N ++;
    }
    public Item pop(){
        Item item = first.item;
        first = first.next;
        N --;
        return item;
    }
}

2.队列

import java.util.Iterator;
public class Queue<Item> implements Iterable<Item>{
    private Node first;
    private Node last;
    private int N;
    private class QueueIterator implements Iterator<Item>{
        private Node current = first;
        public boolean hasNext(){
            return current != null;
        }
        public void remove(){}
        public Item next(){
            Item item = current.item;
            current =  current.next;
            return item;
        }
    }
    public Iterator<Item> iterator(){
        return new QueueIterator();
    }
    private class Node{
        Item item;
        Node next;
    }

    public boolean isEmpty(){
        return N == 0;
    }
    public int size(){
        return N;
    }
    public void enqueue(Item item){
        Node oldlast = last;
        last = new Node();
        last.item = item;
        last.next = null;
        if(isEmpty())   
            first = last;
        else
            oldlast.next = last;
        N ++;
    }
    public Item dequeue(){
        Item item = first.item;
        first = first.next;
        if(isEmpty())
            last = null;
        N --;
        return item;
    }
}

上面两个数据结构都是使用链表实现的，它可以动态的扩展和收缩，插入删除方便，但是每一个节点都需要一个引用，牺牲存储空间以获得效率的提高。而且如果想要访问一个节点首先要获得它的引用，而数组可以通过索引迅速访问任意元素。