0% found this document useful (0 votes)

15 views19 pages

Queue Methods

The document describes various methods for manipulating a queue data structure, including moving elements, counting occurrences, and modifying values at specific indexes. It also covers functionalities like removing duplicates, reversing the queue, and splitting it into sub-queues. Additionally, it includes methods for checking if a queue is a palindrome and finding the minimum value within the queue.

Uploaded by

lollmaolmaolol04

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as DOCX, PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

15 views19 pages

Queue Methods

Uploaded by

lollmaolmaolol04

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as DOCX, PDF, TXT or read online on Scribd

// moves all the elements between start and end including start and

end to the index of newStart and moves the element in newStart to

after the element of end,

Queue x = {1, 2, 3, 4, 5, 6}; moveTo(x, 1, 3, 0) // can’t move to

anywhere between

1=<newStart<3

Here we chose the indexes 1-3 which is {2, 3, 4} to move to index 0

which is {1}

So after using the method x will be: x = {2, 3, 4, 1, 5, 6}

Let x = {1, 2, 3, 4, 5, 6}

To move the chosen indexes to the last index the newStart should be
equal to

((sizeQ(x)-1)-((end)- (start))) in this case 3 so to move {2, 3, 4} to the

last index the operation will look like this moveTo(x, 1, 3, 3) it’ll result
in x = {1, 5, 6, 2, 3, 4}

public static <T> void moveTo(Queue<T> q, int start, int end, int
newStart) {

if(newStart == sizeQ(q)){
if (start == end) {
return;
}
Queue<T> tempQueue = new Queue<>();
Queue<T> movedElements = new Queue<>();

for (int i = 0; i < start; i++) {

[Link]([Link]());
}
for (int i = start; i <= end; i++) {
[Link]([Link]());
}
while (![Link]()) {
[Link]([Link]());
}
while (![Link]()) {
[Link]([Link]());
}

while (![Link]()) {
[Link]([Link]());
}
}else {
Queue<T> temp = new Queue<>();
Queue<T> moved = new Queue<>();

int i = 0;
while (i < start) {
[Link]([Link]());
i++;
}

i = start;
while (i <= end) {
[Link]([Link]());
i++;
}

while (![Link]()) {
[Link]([Link]());
}

i = 0;
while (i < newStart) {
[Link]([Link]());
i++;
}

while (![Link]()) {
[Link]([Link]());
}

while (![Link]()) {
[Link]([Link]());
}
}
}
// creates a Queue of integers with the indexes at which there is val in
the Queue

x = {1, 2, 3, 4, 1}; Queue<Integer> y = OcValQ(x, 1); = {0, 4}

public static <T> Queue<Integer> OcValQ(Queue<T> q, T val) {

Queue<Integer> indices = new Queue<>();
Queue<T> tempQueue = copyQ(q);
int count = 0;

while (![Link]()) {
T element = [Link]();
if ([Link](val)) {
[Link](count);
}
count++;
}

return indices;
}
// removes every of the None first Occurrences of any value in a Q,

X = {1, 2, 3, 4, 1} removeNonFirstOccurrencesQ(x) results in x = {1, 2,

3, 4}
public static <T> void removeNonFirstOccurrencesQ(Queue<T>
queue) {
if ([Link]()) return;

Queue<T> uniqueElements = new Queue<>();

Queue<T> tempQueue = new Queue<>();

while (![Link]()) {
T current = [Link]();
if (!containsElementQ(uniqueElements, current)) {
[Link](current);
[Link](current);
}
}

while (![Link]()) {
[Link]([Link]());
}
}
// inserts chosen value at chosen index, x = {1, 2, 3, 4}; insertQ(x, 0,
4) results in

x = {4, 1, 2, 3, 4}

public static <T> void insertQ(Queue<T> queue, int index, T value) {

Queue<T> tempQueue = new Queue<>();
int currentIndex = 0;
boolean inserted = false;

while (![Link]()) {
if (currentIndex == index) {
[Link](value);
inserted = true;
}
[Link]([Link]());
currentIndex++;
}
if (index >= currentIndex) {
[Link](value);
inserted = true;
}
if (!inserted) {
[Link](value);
}
while (![Link]()) {
[Link]([Link]());
}
}
// sets the value at a specific index of a queue, x = {1, 2}; setQ(x, 0,
4); x = {4, 2}

public static <T> void setQ(Queue<T> queue, int index, T value) {

Queue<T> tempQueue = new Queue<>();
int i = 0;

// creates a copy of another Queue, x = {1, 2, 3, 4} Queue<Integer> y

= copyQ(x) = x

public static <T> Queue<T> copyQ(Queue<T> originalQueue) {

Queue<T> copy = new Queue<>();
Queue<T> tempQueue = new Queue<>();
while (![Link]()) {
T element = [Link]();
[Link](element);
[Link](element);
}
while (![Link]()) {
[Link]([Link]());
}
return copy;
}
// deletes a specific index of a Queue, x = {1, 2, 3, 4}; deleteQ(x, 0);

results in x = {2, 3, 4}
public static <T> void deleteQ(Queue<T> queue, int index) {

Queue<T> tempQueue = new Queue<>();

int currentIndex = 0;

while (![Link]()) {
if (currentIndex != index) {
[Link]([Link]());
} else {
[Link]();
}
currentIndex++;
}

while (![Link]()) {
[Link]([Link]());
}
}

//gets the size of a Queue, x = {1, 2, 3, 4}; sizeQ(x) = 4

public static <T> int sizeQ(Queue<T> x) {
Queue<T> tempQueue = new Queue<T>();
Queue<T> tempQueue2 = new Queue<T>();

while(![Link]()){
[Link]([Link]());
[Link]([Link]());
}
while (![Link]()){
[Link]([Link]());
}
int size = 0;

while (![Link]()) {
[Link]();
size++;
}

return size;
}

//checks if a Queue contains a specific value

public static <T> boolean containsValQ(Queue<T> queue, T value) {
Queue<T> tempQ = copyQ(queue);

while (![Link]()) {
if ([Link]().equals(value)) {
return true;
}
}
return false;
}

// reverses a Queue

public static <T> void reverseQ(Queue<T> queue) {

if ([Link]() || queue == null) return;
T x = [Link]();
reverseQ(queue);
[Link](x);
}

// checks if a Queue is a sub queue of another queue, x = {1, 2, 3, 4};

y = {2, 3};

subQ(x, y) = true, subQ(y, x) = false, whole of x isn’t a part of y

public static <T> boolean subQ(Queue<T> x, Queue<T> y) {

if ([Link]())return true;

if ([Link]() || sizeQ(x) < sizeQ(y)) return false;

Queue<T> tempX = copyQueueQ(x);

Queue<T> tempY = copyQueueQ(y);

while (![Link]()) {
T elementX = [Link]();
T elementY = [Link]();

if ([Link](elementY)) {
[Link]();
if ([Link]()) {
return true;
}
} else {
tempY = copyQueueQ(y);
}
}
return false;
}

// counts how many times there is a chosen value in a Queue, x = {1,

2, 1}
int value = countOccQ(x, 1) = 2
public static <T> int countOccQ(Queue<T> queue, T value) {
int count = 0;
Queue<T> tempQueue = new Queue<>();

while (![Link]()) {
T current = [Link]();
if ([Link](value)) {
count++;
}
[Link](current);
}
while(![Link]()) [Link]([Link]());
return count;
}

//creates a reversed version of a Queue, x = {1, 2, 3, 4};

Queue<Integer> y = reverseA(x) = {4, 3, 2, 1}

public static <T> Queue<T> reverseA(Queue<T> queue) {

Queue<T> temp = copyQ(queue);
Queue<T> reversedQueue = new Queue<>();
reverseQB(temp, reversedQueue);
return reversedQueue;
}

public static <T> void reverseQB(Queue<T> queue, Queue<T>

reversedQueue) {
if ([Link]()) {
return;
}

T element = [Link]();
reverseQB(queue, reversedQueue);
[Link](element);
}

//checks if a Queue is a palindrome a word, phrase, or sequence that

reads the same backward as forward
public static <T> boolean isPalindrome(Queue<T> queue) {
if ([Link]() || sizeQ(queue) == 1) {
return true;
}

Queue<T> reversedQueue = reverseA(queue);

while (![Link]()) {
T frontElement = [Link]();
T reversedElement = [Link]();

if (![Link](reversedElement)) {
return false;
}
}

return true;
}

//removes only the none first consecutive occurrences of every value in

a Queue
After using the method on x = {1, 1, 2, 3, 2, 2, 1}, x will be {1, 2, 3, 2,
1}

public static <T> void removeConsecutiveOccurrencesQ(Queue<T>

queue) {
if ([Link]() || sizeQ(queue) == 1) return;

Queue<T> tempQueue = new Queue<>();

T prev = [Link]();
[Link](prev);

while (![Link]()) {
T current = [Link]();
if (![Link](prev)) {
[Link](current);
prev = current;
}
}
while (![Link]()) {
[Link]([Link]());
}
}

// deletes every index of a Node at which there is a specific value at.

public static <T> void deleteQT(Queue<T> head, T value) {

for(int i = 0; i<sizeQ(head); i++){

if(getQ(head, i) == value) {

deleteQ(head, i);

i--;

}
// splits a Queue into a Queue of Queues with the sizeQ of n,

Queue<Integer> x = {1, 2, 3, 4, 5}, Queue<Queue<Integer>> y =

split(x, 4)

results in y = {{1, 2}, {3}, {4}, {5}}

Another example: Queue<Integer> x = {1, 2, 3, 4, 5};

Queue<Queue<Integer>> y = split(x, 2); results in y = {{1, 2, 3}, {4,

5}}

public static <T> Queue<Queue<T>> splitQ(Queue<T> q, int n) {

if ([Link]() || n <= 0) return null;

int size = sizeQ(q);

int partSize = size / n;
int remainder = size % n;

Queue<Queue<T>> resultQueue = new Queue<>();

Queue<T> currentPart = null;

for (int i = 0; i < n; i++) {

currentPart = new Queue<>();
int currentPartSize = partSize + (i < remainder ? 1 : 0);

for (int j = 0; j < currentPartSize; j++) {

if (![Link]()) {
[Link]([Link]());
}
}

[Link](currentPart);
}

return resultQueue;
}
//creates a Queue which is the sorted version of queue

public static Queue<Integer> sortQ(Queue<Integer> queue) {

Queue<Integer> sortedQueue = new Queue<>();

while (![Link]()) {
int current = [Link]();
Queue<Integer> tempQueue = new Queue<>();
boolean inserted = false;

while (![Link]()) {
int value = [Link]();
if (!inserted && current < value) {
[Link](current);
inserted = true;
}
[Link](value);
}
if (!inserted) {
[Link](current);
}
while (![Link]()) {
[Link]([Link]());
}
}
return sortedQueue;
}
//The method takes the selected Queue(queue) and will create a new
splited Queue out of it according the the chosen start and end. for
example:

A = {1, 2, 3, 4, 5, 6} and B = CSplitQ(A, 1, 3) so it'll result in B = {{1},

{2, 3, 4}, {5 ,6}} because {2, 3, 4} are at indexes 1-3, 2 is at index 1
and 4 is at index 3

B is a Queue<Queue<Integer>> in this example.

public static <T> Queue<Queue<T>> CSplitQ(Queue<T> queue, int

start, int end) {
if ([Link]() || start > end) return null;

Queue<Queue<T>> resultQueue = new Queue<>();

Queue<T> firstPart = new Queue<>();
Queue<T> middlePart = new Queue<>();
Queue<T> lastPart = new Queue<>();

int index = 0;
while (![Link]() && index < start) {
[Link]([Link]());
index++;
}

while (![Link]() && index <= end) {

[Link]([Link]());
index++;
}

while (![Link]()) [Link]([Link]());

if (![Link]()) [Link](firstPart);
if (![Link]()) [Link](middlePart);
if (![Link]()) [Link](lastPart);

return resultQueue;
}
//find the min value in the queue

public static int findMinQ(Queue<Integer> queue) {

if ([Link]())return 0; // a mistake, it should return nothing

Queue<Integer> tempQueue = new Queue<>();

int min = Integer.MAX_VALUE;

while (![Link]()) {
int current = [Link]();
if (current < min) {
min = current;
}
[Link](current);
}
while (![Link]())
[Link]([Link]());

return min;
}
//finds the max value in the queue
public static <T> int findMaxQ(Queue<Integer> queue) {
if ([Link]()) return 0; // a mistake it should return nothing

Queue<Integer> tempQueue = new Queue<>();

int max = Integer.MIN_VALUE;

while (![Link]()) {
int current = [Link]();
if (current > max) {
max = current;
}
[Link](current);
}
while (![Link]()) [Link]([Link]());

return max;
}
Magnitude of running time, Order of DE via degree of n

1. moveTo = O(n)
2. OcValQ = O(n)
3. removeNoneFirstOccurrencesQ = O(n)
4. insertQ = O(n)
5. setQ = O(n)
6. getQ = O(n)
7. copyQ = O(n)
8. delete = O(n)
9. sizeQ = O(n)
10. containsValueQ = O(n)
11. reverseQ = O(n)
12. subQ = O(n)
13. countOccQ = O(n)
14. reverseA = O(n)
15. isPalindrome = O(n)
16. removeConsecutiveOccurrences = O(n)
17. deleteQT = O(n^2)
18. splitQ = O(n)
19. sortQ = O(n)
20. CSplitQ = O(n)
21. findMinQ = O(n)
22. findMaxQ = O(n)

//How to create a Queue:

Queue<data type> x = new Queue<>();

How to add values to the Queue:

(Name of Queue).insert(value of same data type of the Queue)

Queue<Integer> x = new Queue<>();

[Link](1) – index 0

[Link](2) – index 1
// The Queue class:

public boolean isEmpty() {

return [Link] == null;
}
public void insert(T x) {
if ([Link] == null) {
[Link] = new Node(x);
[Link] = [Link];
} else {
[Link](new Node(x));
[Link] = [Link]();
}
}
public T remove() {
T x = [Link]();
Node<T> pos = [Link];
[Link] = [Link]();
if ([Link] == null) {
[Link] = null;
}
[Link]((Node)null);
return x;
}
public T head() {
return [Link]();
}
public String toString() {
Node<T> pos = [Link];

String str;
for(str = "["; pos != null; pos = [Link]()) {
str = str + [Link]().toString();
if ([Link]() != null) {
str = str + ",";
}
}
str = str + "]";
return str;
}

Queues
No ratings yet
Queues
11 pages
Queue Assignment
No ratings yet
Queue Assignment
25 pages
Queueusing Array
No ratings yet
Queueusing Array
16 pages
Lab 4
No ratings yet
Lab 4
18 pages
Lecture 5 Queue DSA
No ratings yet
Lecture 5 Queue DSA
35 pages
Data Structures: Queues Explained
No ratings yet
Data Structures: Queues Explained
10 pages
Data Structure Lab 9
No ratings yet
Data Structure Lab 9
6 pages
Java Dequeue Class Implementation
No ratings yet
Java Dequeue Class Implementation
3 pages
Module 6 - Queue
No ratings yet
Module 6 - Queue
17 pages
Queue Implementation Guide
50% (2)
Queue Implementation Guide
7 pages
DS Notes by Abhi
No ratings yet
DS Notes by Abhi
19 pages
Queue Implementation
No ratings yet
Queue Implementation
32 pages
Practical 3 - Queue Implementation
No ratings yet
Practical 3 - Queue Implementation
2 pages
Stack Implementation with Linked List in Java
No ratings yet
Stack Implementation with Linked List in Java
20 pages
5 Queue
No ratings yet
5 Queue
19 pages
Java Queue Implementations Overview
No ratings yet
Java Queue Implementations Overview
7 pages
ch04 Queues
No ratings yet
ch04 Queues
72 pages
Queue Code
No ratings yet
Queue Code
1 page
Queue
No ratings yet
Queue
4 pages
اسلايدز 7
No ratings yet
اسلايدز 7
39 pages
Introduction to Queues in IT2070
No ratings yet
Introduction to Queues in IT2070
27 pages
Enter The Size of The Queue: 8 Menu 1. Enqueue 2. Dequeue 3. Display Queue 4. Exit Enter Choice (1..4)
No ratings yet
Enter The Size of The Queue: 8 Menu 1. Enqueue 2. Dequeue 3. Display Queue 4. Exit Enter Choice (1..4)
5 pages
Stack and Queue 2022
No ratings yet
Stack and Queue 2022
5 pages
CirculerQ and Dqueue
No ratings yet
CirculerQ and Dqueue
12 pages
Java Queue ADT Implementation Guide
No ratings yet
Java Queue ADT Implementation Guide
5 pages
Dsa Lab File
No ratings yet
Dsa Lab File
11 pages
Queue Notes
No ratings yet
Queue Notes
12 pages
Queue
No ratings yet
Queue
3 pages
Data Structure
No ratings yet
Data Structure
9 pages
Source Code
No ratings yet
Source Code
2 pages
Skill5 32536 PDF
No ratings yet
Skill5 32536 PDF
6 pages
New Circular Queue
No ratings yet
New Circular Queue
4 pages
Program 9
No ratings yet
Program 9
7 pages
‏لقطة شاشة 2024-04-22 في 10.32.36 ص
No ratings yet
‏لقطة شاشة 2024-04-22 في 10.32.36 ص
3 pages
DS T2 Programs V2
No ratings yet
DS T2 Programs V2
5 pages
Skillw5 32536
No ratings yet
Skillw5 32536
6 pages
LAB 1: Programming in C To Analyse The Complexity of Different Programs
No ratings yet
LAB 1: Programming in C To Analyse The Complexity of Different Programs
28 pages
Array Queue Implementation in Java
No ratings yet
Array Queue Implementation in Java
13 pages
Chapter 5: Queues: Bcs1223: Data Structures & Algorithms
No ratings yet
Chapter 5: Queues: Bcs1223: Data Structures & Algorithms
43 pages
Queue: Prepared By: Abdul Jalil Niazai
No ratings yet
Queue: Prepared By: Abdul Jalil Niazai
9 pages
Theory PDF
No ratings yet
Theory PDF
26 pages
STACK
No ratings yet
STACK
4 pages
Record Oop Cs3381
No ratings yet
Record Oop Cs3381
71 pages
Circular Queue Implementation C++
No ratings yet
Circular Queue Implementation C++
6 pages
Queue Data Structure
No ratings yet
Queue Data Structure
20 pages
Queues
No ratings yet
Queues
34 pages
Queue Operations and Implementation Guide
No ratings yet
Queue Operations and Implementation Guide
24 pages
FALLSEM2024-25 CSE2001 ETH AP2024252000441 Quiz-I-Question-Paper
No ratings yet
FALLSEM2024-25 CSE2001 ETH AP2024252000441 Quiz-I-Question-Paper
31 pages
Stack Using Arrays
No ratings yet
Stack Using Arrays
12 pages
Wa0012
No ratings yet
Wa0012
19 pages
Unit - 3 Queue
No ratings yet
Unit - 3 Queue
14 pages
2379
No ratings yet
2379
8 pages
Msc:Mphil GROUP 4 Queue
No ratings yet
Msc:Mphil GROUP 4 Queue
4 pages
Question 23
No ratings yet
Question 23
6 pages
Unit-4 Queue
No ratings yet
Unit-4 Queue
10 pages
Queue DSAJV
No ratings yet
Queue DSAJV
2 pages
Module-3 Q&a
No ratings yet
Module-3 Q&a
33 pages
Opening Up Prince Charming With The Right Strategy
No ratings yet
Opening Up Prince Charming With The Right Strategy
317 pages
COT MATH5 qtr3 Wk7
No ratings yet
COT MATH5 qtr3 Wk7
10 pages
Chapter 22 - Answer
No ratings yet
Chapter 22 - Answer
6 pages
Lidar Correction Tool for Complex Terrain
No ratings yet
Lidar Correction Tool for Complex Terrain
1 page
CA Scope June Examinations 2025
No ratings yet
CA Scope June Examinations 2025
2 pages
Research RRL
No ratings yet
Research RRL
12 pages
Performance Task - Arts
No ratings yet
Performance Task - Arts
6 pages
Enviromental3 Safe Places
0% (1)
Enviromental3 Safe Places
10 pages
Sow C++ Cso Chapter 03 9e
No ratings yet
Sow C++ Cso Chapter 03 9e
69 pages
38 - Imam Al-Ghazali
No ratings yet
38 - Imam Al-Ghazali
14 pages
Rampurhat Jitendralal Vidyabhaban: Admission Form Xi (Session)
No ratings yet
Rampurhat Jitendralal Vidyabhaban: Admission Form Xi (Session)
2 pages
Evolution of Japanese Poetry Styles
No ratings yet
Evolution of Japanese Poetry Styles
17 pages
Educators' Guide to Brain Development
No ratings yet
Educators' Guide to Brain Development
6 pages
Ore Reserve Estimation Methods Overview
100% (4)
Ore Reserve Estimation Methods Overview
4 pages
One-Way ANOVA Estimation Guide
No ratings yet
One-Way ANOVA Estimation Guide
35 pages
Teacher Resume Writing Guide
100% (2)
Teacher Resume Writing Guide
4 pages
People V Aruta
No ratings yet
People V Aruta
3 pages
Invention Offer Letter
No ratings yet
Invention Offer Letter
2 pages
FTS-CCA Review1
No ratings yet
FTS-CCA Review1
10 pages
GDA FG Revise PDF
50% (2)
GDA FG Revise PDF
334 pages
Data Analaysis & Interpretation: 1 Are You Aware of National Pension System?
No ratings yet
Data Analaysis & Interpretation: 1 Are You Aware of National Pension System?
9 pages
Muslim League and Partition Plan
No ratings yet
Muslim League and Partition Plan
3 pages
Freud's Shift: From Neurosis to Sexual Biology
No ratings yet
Freud's Shift: From Neurosis to Sexual Biology
16 pages
Venansio Babweyaka and Others V Kampala District Land Board and Another Civil Suit No511 of 2001 2005 Ughc 5 29 June 200 4
No ratings yet
Venansio Babweyaka and Others V Kampala District Land Board and Another Civil Suit No511 of 2001 2005 Ughc 5 29 June 200 4
19 pages
Unit 12 - Lesson B: What's For Dinner?: Touchstone 2nd Edition - Language Summary - Level 1
No ratings yet
Unit 12 - Lesson B: What's For Dinner?: Touchstone 2nd Edition - Language Summary - Level 1
4 pages
Solubility and Simultaneous Equilibria: Chemistry: The Molecular Nature of Matter, 6E
No ratings yet
Solubility and Simultaneous Equilibria: Chemistry: The Molecular Nature of Matter, 6E
59 pages
Week No. 3 Demand & Supply Part-1
No ratings yet
Week No. 3 Demand & Supply Part-1
56 pages
Amended Complaint Against NCHS and Superior Court
100% (1)
Amended Complaint Against NCHS and Superior Court
48 pages
Module 2 World Religion
No ratings yet
Module 2 World Religion
7 pages
Table Tennis Knowledge Assessment
No ratings yet
Table Tennis Knowledge Assessment
3 pages

Queue Methods

Uploaded by

Queue Methods

Uploaded by

// moves all the elements between start and end including start and

end to the index of newStart and moves the element in newStart to

Queue x = {1, 2, 3, 4, 5, 6}; moveTo(x, 1, 3, 0) // can’t move to

Here we chose the indexes 1-3 which is {2, 3, 4} to move to index 0

So after using the method x will be: x = {2, 3, 4, 1, 5, 6}

((sizeQ(x)-1)-((end)- (start))) in this case 3 so to move {2, 3, 4} to the

for (int i = 0; i < start; i++) {

x = {1, 2, 3, 4, 1}; Queue<Integer> y = OcValQ(x, 1); = {0, 4}

public static <T> Queue<Integer> OcValQ(Queue<T> q, T val) {

X = {1, 2, 3, 4, 1} removeNonFirstOccurrencesQ(x) results in x = {1, 2,

Queue<T> uniqueElements = new Queue<>();

public static <T> void insertQ(Queue<T> queue, int index, T value) {

public static <T> void setQ(Queue<T> queue, int index, T value) {

while (i <= index && ![Link]()) {

// creates a copy of another Queue, x = {1, 2, 3, 4} Queue<Integer> y

public static <T> Queue<T> copyQ(Queue<T> originalQueue) {

Queue<T> tempQueue = new Queue<>();

//gets the size of a Queue, x = {1, 2, 3, 4}; sizeQ(x) = 4

//checks if a Queue contains a specific value

public static <T> void reverseQ(Queue<T> queue) {

// checks if a Queue is a sub queue of another queue, x = {1, 2, 3, 4};

subQ(x, y) = true, subQ(y, x) = false, whole of x isn’t a part of y

public static <T> boolean subQ(Queue<T> x, Queue<T> y) {

if ([Link]() || sizeQ(x) < sizeQ(y)) return false;

Queue<T> tempX = copyQueueQ(x);

// counts how many times there is a chosen value in a Queue, x = {1,

//creates a reversed version of a Queue, x = {1, 2, 3, 4};

Queue<Integer> y = reverseA(x) = {4, 3, 2, 1}

public static <T> Queue<T> reverseA(Queue<T> queue) {

public static <T> void reverseQB(Queue<T> queue, Queue<T>

//checks if a Queue is a palindrome a word, phrase, or sequence that

Queue<T> reversedQueue = reverseA(queue);

//removes only the none first consecutive occurrences of every value in

public static <T> void removeConsecutiveOccurrencesQ(Queue<T>

Queue<T> tempQueue = new Queue<>();

// deletes every index of a Node at which there is a specific value at.

public static <T> void deleteQT(Queue<T> head, T value) {

for(int i = 0; i<sizeQ(head); i++){

Queue<Integer> x = {1, 2, 3, 4, 5}, Queue<Queue<Integer>> y =

results in y = {{1, 2}, {3}, {4}, {5}}

Another example: Queue<Integer> x = {1, 2, 3, 4, 5};

Queue<Queue<Integer>> y = split(x, 2); results in y = {{1, 2, 3}, {4,

public static <T> Queue<Queue<T>> splitQ(Queue<T> q, int n) {

int size = sizeQ(q);

Queue<Queue<T>> resultQueue = new Queue<>();

for (int i = 0; i < n; i++) {

for (int j = 0; j < currentPartSize; j++) {

public static Queue<Integer> sortQ(Queue<Integer> queue) {

A = {1, 2, 3, 4, 5, 6} and B = CSplitQ(A, 1, 3) so it'll result in B = {{1},

B is a Queue<Queue<Integer>> in this example.

public static <T> Queue<Queue<T>> CSplitQ(Queue<T> queue, int

Queue<Queue<T>> resultQueue = new Queue<>();

while (![Link]() && index <= end) {

while (![Link]()) [Link]([Link]());

public static int findMinQ(Queue<Integer> queue) {

Queue<Integer> tempQueue = new Queue<>();

Queue<Integer> tempQueue = new Queue<>();

//How to create a Queue:

Queue<data type> x = new Queue<>();

How to add values to the Queue:

(Name of Queue).insert(value of same data type of the Queue)

Queue<Integer> x = new Queue<>();

public boolean isEmpty() {

You might also like