Without using C++ queue STL, write a simple menu based selection to insert, delete, show and exit from queue. 1. Create a class called Queue with member variable queueArr as integer queue array, integer rear and integer front to keep track both rear and front element in the queue array. 2. Define several member functions in Queue such as: a) constructor – initialize both rear and front to -1 b) insert – receive an integer and check if queue is full, if not then insert the integer to the queue array c) delete – delete front element from queue if front is not equal to rear (empty) d) display – if rear is not equal to front, then print out the queue array. 3. Write a main function to test the Queue class.
Types of Linked List
A sequence of data elements connected through links is called a linked list (LL). The elements of a linked list are nodes containing data and a reference to the next node in the list. In a linked list, the elements are stored in a non-contiguous manner and the linear order in maintained by means of a pointer associated with each node in the list which is used to point to the subsequent node in the list.
Linked List
When a set of items is organized sequentially, it is termed as list. Linked list is a list whose order is given by links from one item to the next. It contains a link to the structure containing the next item so we can say that it is a completely different way to represent a list. In linked list, each structure of the list is known as node and it consists of two fields (one for containing the item and other one is for containing the next item address).
Without using C++ queue STL, write a simple menu based selection to insert, delete, show and exit from queue.
1. Create a class called Queue with member variable queueArr as integer queue array, integer rear and integer front to keep track both rear and front element in the queue array.
2. Define several member functions in Queue such as:
a) constructor – initialize both rear and front to -1
b) insert – receive an integer and check if queue is full, if not then insert the integer to the queue array
c) delete – delete front element from queue if front is not equal to rear (empty)
d) display – if rear is not equal to front, then print out the queue array.
3. Write a main function to test the Queue class.
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
