Queue dalam java

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.LinkedList;
import java.util.Queue;
public class Antrian {
private static int ukuran;
private static Queue queue;

public static void main(String[] args) {
System.out.print("Berapa ukuran QUEUE diinginkan? ");
ukuran = inputData();
buatQueue();
bacaData();
tulisData();

}

private static void buatQueue() {
queue = new LinkedList();
}

private static int inputData() {
BufferedReader bfr = new BufferedReader(
new InputStreamReader(System.in));
String angkaInput = null;
try {
angkaInput = bfr.readLine();
} catch (IOException e) {
e.printStackTrace();
}
int Data = Integer.valueOf(angkaInput).intValue();
return Data;
}

private static void tulisData() {
Integer data;
System.out.println("\nUrutan keluar elemen dari QUEUE : ");
for (int i = 0; i < ukuran; i++) {
data = queue.remove();
System.out.println("Data ke-" + (i + 1) + " : " + data);
}
data = queue.size();
System.out.println("Ukuran QUEUE sekarang adalah " + data);
}

private static void bacaData() {
Integer data;
for (int i = 0; i < ukuran; i++) {
System.out.print("Data ke-" + (i + 1) + " : ");
data = inputData();
queue.add(data);
}
data = queue.size();
System.out.println("Ukuran QUEUE sekarang adalah " + data);
}
}

linked list dalam java

package LinkedListDoublyJava;
public class LinkedListDoubly {
public LinkedListDoubly( ) {
header = new ListNode( null );
}

public boolean isEmpty( ) {
return header.next == null;
}

public void makeEmpty( ) {
header.next = null;
}

public LinkedListIterator zeroth( ) {
return new LinkedListIterator( header );
}

public LinkedListIterator first( ) {
return new LinkedListIterator( header.next );
}

public void insert( Object x, LinkedListIterator p ) {
if( p != null && p.current != null )
p.current.next = new ListNode( x, p.current.next );
}

public LinkedListIterator find( Object x ) {
ListNode itr = header.next;

while( itr != null && !itr.element.equals( x ) )
itr = itr.next;

return new LinkedListIterator( itr );
}