Java实现基本的栈和队列

用链表结构实现一个栈和队列，这么简单的一个基础问题，网上居然没有一个简洁明了的代码。就只能自己写写了。

class Node<U> {
    U item;
    Node<U> next;

    public Node() {
        this.item = null;
        this.next = null;
    }

    public Node(U item, Node<U> node) {
        this.item = item;
        this.next = node;
    }

    public boolean end() {
        return item == null && next == null;
    }
}

public class LinkStack<T> {

    Node<T> top = new Node<>();

    public void push(T item) {
        top = new Node<T>(item, top);
    }

    public T pop() {
        T result = top.item;
        if (!top.end()) {
            top = top.next;
        }
        return result;
    }
}

public class LinkQueue<T> {

    Node<T> head = new Node<T>();
    Node<T> tail = new Node<T>();

    public void add(T item) {
        if (head.item == null) {
            head = new Node<T>(item, null);
            tail = head;
        } else {
            tail.next = new Node<T>(item, null);
            tail = tail.next;
        }
    }

    public T remove() {
        T result = null;
        if (head != null && !head.end()) {
            result = head.item;
            head = head.next;
        }
        return result;
    }


}

还是希望所有人能够注重下基础吧。