java queue
import java.util.*;
Queue<Integer> queue = new LinkedList<Integer>();
// use non-primative types when constructing
// to add a value to the back of queue:
queue.add(7);
// to remove and return front value:
int next = queue.remove();
// to just return front value without removing:
int peek = queue.peek();queue in java
//this a basic one
public class prosses {
int [] s;
int quu;
int tu;
prosses () {//constructor
s = new int[20];
quu = -1;
tu = 0;
}
void enqueue (int d) {//for input and prosses
if (quu >= 19) {
System.out.println("stack is full");
} else {
s[++quu] = d;
}
}
int dequeue(){//to send the output
if(quu<0 && quu>19 && tu<0 && tu>19) {
System.out.println("not possible");
return 'n';
}
return s[tu++];
}
}Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
