Using LinkedList to simulate a stack or queue data structure

Use LinkedList to simulate a stack or queue data structure.

Stack: Advanced after out like a cup.

Queue: FIFO is like a water pipe.

import java.util.LinkedList; Public classDuilie {PrivateLinkedList link;  PublicDuilie () {link=NewLinkedList (); }     Public voidmyadd (Object obj) {link.addfirst (obj); }     PublicObject MyGet () {//return Link.removelast ();//Queue        returnLink.removefirst ();//Stack    }     PublicBoolean isNull () {returnLink.isempty (); }}

import java.util.LinkedList; Public classDuilie {PrivateLinkedList link;  PublicDuilie () {link=NewLinkedList (); }     Public voidmyadd (Object obj) {link.addfirst (obj); }     PublicObject MyGet () {returnLink.removelast ();//Queue//return Link.removefirst ();//Stack    }     PublicBoolean isNull () {returnLink.isempty (); }}

Run results

Using LinkedList to simulate a stack or queue data structure