QUEUE atau ANTRIAN

QUEUE (Antrian)
-Enqueue
-Dequeue


# void enqueue (int data){
if (depan ==null){
depan = new Node;
belakang = depan;
belakang -> data = data;
}
else{
belakang -> next = new Node;
belakang = belakang -> next;
belakang -> data = data;

int dequeue(){
Node *to Delete;
to Delete = depan;
depan = depan -> next;
int temp = to Delete -> data;
delete to Delete;
return temp;
}
else{
return NULL;
}