To Develop your own Queue in Java

import java.util.LinkedList;

/*to develop my own Queue from removeFromQueue()*/

class MyQueue {

private LinkedList list = new LinkedList();

public void addToQueue(Object obj){
list.add(obj);
}
public Object removeFromQueue(){
return list.removeFirst();
}
public String toString(){
return list.toString();
}
}

public class Manager4 {

public static void main(String[] args) {
MyQueue st = new MyQueue();
st.addToQueue(100);
st.addToQueue(200);
st.addToQueue(30);
st.addToQueue(10);
System.out.println(st);
System.out.println(st.removeFromQueue());
System.out.println(st);
}
}

To Develop your own Stack in Java

import java.util.LinkedList;

/*to develop my own Stack */

class MYStack {
@SuppressWarnings("unchecked")
private LinkedList list = new LinkedList();
@SuppressWarnings("unchecked")
public void pushToStack(Object obj){
list.add(obj);
}
public Object popFromStack(){
return list.removeLast();
}
public String toString(){
return list.toString();
}
}

public class Manager {
public static void main(String[] args) {
MYStack st = new MYStack();
st.pushToStack(100);
st.pushToStack(200);
st.pushToStack(30);
st.pushToStack(10);
System.out.println(st);
System.out.println(st.popFromStack());
System.out.println(st);
}
}