Question: 2- Given following data structure of queue : class QueueNode { int info ; QueueNode link; . } class Queue { QueueNode front , rear
2- Given following data structure of queue :
class QueueNode
{
int info ;
QueueNode link;
.
}
class Queue
{
QueueNode front , rear ;
.
// Methods to .
}
Write a JAVA method which receives an integer value and insert it before the last node in a queue.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
