![please tell me what lines do i alter to make this stack a queue. tell me what to change it to
#include
using namespace std;
const int MAXSIZE = 100; // Maximum size of the stack
class Stack {
private:
int top; // Index of the top element in the stack
int data[MAXSIZE]; // Array to hold the stack elements
public:
Stack () {
top = -1; // Initialize the top index to -1 to indicate an empty stack
}
bool push (int val) {
if (top == MAXSIZE - 1) { // Stack is full
return false;
}
top++; // Increment the top index
data[top] = val; // Add the new element to the top of the stack
return true;
}
bool pop() {
if (top == -1) { // Stack is empty
return false;
}](https://image.slidesharecdn.com/pleasetellmewhatlinesdoialtertomakethisstackaqueue-230322175425-e1cb8048/85/please-tell-me-what-lines-do-i-alter-to-make-this-stack-a-queue-tel-pdf-1-320.jpg)
![top--; // Decrement the top index to remove the top element
return true;
}
bool peek(int& val) {
if (top == -1) { // Stack is empty
return false;
}
val = data[top]; // Return the top element without removing it.
return true;
}
void display(ostream& out) {
if (top == -1) { // Stack is empty
out << "Empty stack" << endl;
return;
}
for (int i = top; i >= 0; i--) { // Loop through the stack elements from top to bottom
out << data[i] << "";
}
out << endl;
}
};
int main() {
Stack S;
int tmp;
S.push (5);
S. peek (tmp);
cout << tmp << endl;
S.push (33);
S.push (1);
S.push (7);
S.peek (tmp);
cout << tmp << endl;
S.push (33) ;
S.push (12);](https://image.slidesharecdn.com/pleasetellmewhatlinesdoialtertomakethisstackaqueue-230322175425-e1cb8048/85/please-tell-me-what-lines-do-i-alter-to-make-this-stack-a-queue-tel-pdf-2-320.jpg)
![S.display ( cout );
S.pop ( );
S.display ( cout );
S.push (14);
S.display ( cout );
S.pop ( ) ;
S.pop ( );
S.display ( cout );
S.pop ( );
S. pop ( ) ;
S.display ( cout );
S.peek (tmp);
cout << tmp << endl;
}
#include
using namespace std;
const int MAXSIZE = 100; // Maximum size of the stack
class Stack {
private:
int top; // Index of the top element in the stack
int data[MAXSIZE]; // Array to hold the stack elements
public:
Stack () {
top = -1; // Initialize the top index to -1 to indicate an empty stack
}](https://image.slidesharecdn.com/pleasetellmewhatlinesdoialtertomakethisstackaqueue-230322175425-e1cb8048/85/please-tell-me-what-lines-do-i-alter-to-make-this-stack-a-queue-tel-pdf-3-320.jpg)
![bool push (int val) {
if (top == MAXSIZE - 1) { // Stack is full
return false;
}
top++; // Increment the top index
data[top] = val; // Add the new element to the top of the stack
return true;
}
bool pop() {
if (top == -1) { // Stack is empty
return false;
}
top--; // Decrement the top index to remove the top element
return true;
}
bool peek(int& val) {
if (top == -1) { // Stack is empty
return false;
}
val = data[top]; // Return the top element without removing it.
return true;
}
void display(ostream& out) {
if (top == -1) { // Stack is empty
out << "Empty stack" << endl;
return;
}
for (int i = top; i >= 0; i--) { // Loop through the stack elements from top to bottom
out << data[i] << "";
}
out << endl;
}](https://image.slidesharecdn.com/pleasetellmewhatlinesdoialtertomakethisstackaqueue-230322175425-e1cb8048/85/please-tell-me-what-lines-do-i-alter-to-make-this-stack-a-queue-tel-pdf-4-320.jpg)
![private:
int top; // Index of the top element in the stack
int data[MAXSIZE]; // Array to hold the stack elements
public:
Stack () {
top = -1; // Initialize the top index to -1 to indicate an empty stack
}
bool push (int val) {
if (top == MAXSIZE - 1) { // Stack is full
return false;
}
top++; // Increment the top index
data[top] = val; // Add the new element to the top of the stack
return true;
}
bool pop() {
if (top == -1) { // Stack is empty
return false;
}
top--; // Decrement the top index to remove the top element
return true;
}
bool peek(int& val) {
if (top == -1) { // Stack is empty
return false;
}
val = data[top]; // Return the top element without removing it.
return true;
}
void display(ostream& out) {](https://image.slidesharecdn.com/pleasetellmewhatlinesdoialtertomakethisstackaqueue-230322175425-e1cb8048/85/please-tell-me-what-lines-do-i-alter-to-make-this-stack-a-queue-tel-pdf-6-320.jpg)
![if (top == -1) { // Stack is empty
out << "Empty stack" << endl;
return;
}
for (int i = top; i >= 0; i--) { // Loop through the stack elements from top to bottom
out << data[i] << "";
}
out << endl;
}
};
int main() {
Stack S;
int tmp;
S.push (5);
S. peek (tmp);
cout << tmp << endl;
S.push (33);
S.push (1);
S.push (7);
S.peek (tmp);
cout << tmp << endl;
S.push (33) ;
S.push (12);
S.display ( cout );
S.pop ( );
S.display ( cout );
S.push (14);
S.display ( cout );
S.pop ( ) ;
S.pop ( );
S.display ( cout );
S.pop ( );
S. pop ( ) ;
S.display ( cout );
S.peek (tmp);
cout << tmp << endl;](https://image.slidesharecdn.com/pleasetellmewhatlinesdoialtertomakethisstackaqueue-230322175425-e1cb8048/85/please-tell-me-what-lines-do-i-alter-to-make-this-stack-a-queue-tel-pdf-7-320.jpg)
please tell me what lines do i alter to make this stack a queue. tel.pdf
- 1. please tell me what lines do i alter to make this stack a queue. tell me what to change it to #include using namespace std; const int MAXSIZE = 100; // Maximum size of the stack class Stack { private: int top; // Index of the top element in the stack int data[MAXSIZE]; // Array to hold the stack elements public: Stack () { top = -1; // Initialize the top index to -1 to indicate an empty stack } bool push (int val) { if (top == MAXSIZE - 1) { // Stack is full return false; } top++; // Increment the top index data[top] = val; // Add the new element to the top of the stack return true; } bool pop() { if (top == -1) { // Stack is empty return false; }
- 2. top--; // Decrement the top index to remove the top element return true; } bool peek(int& val) { if (top == -1) { // Stack is empty return false; } val = data[top]; // Return the top element without removing it. return true; } void display(ostream& out) { if (top == -1) { // Stack is empty out << "Empty stack" << endl; return; } for (int i = top; i >= 0; i--) { // Loop through the stack elements from top to bottom out << data[i] << ""; } out << endl; } }; int main() { Stack S; int tmp; S.push (5); S. peek (tmp); cout << tmp << endl; S.push (33); S.push (1); S.push (7); S.peek (tmp); cout << tmp << endl; S.push (33) ; S.push (12);
- 3. S.display ( cout ); S.pop ( ); S.display ( cout ); S.push (14); S.display ( cout ); S.pop ( ) ; S.pop ( ); S.display ( cout ); S.pop ( ); S. pop ( ) ; S.display ( cout ); S.peek (tmp); cout << tmp << endl; } #include using namespace std; const int MAXSIZE = 100; // Maximum size of the stack class Stack { private: int top; // Index of the top element in the stack int data[MAXSIZE]; // Array to hold the stack elements public: Stack () { top = -1; // Initialize the top index to -1 to indicate an empty stack }
- 4. bool push (int val) { if (top == MAXSIZE - 1) { // Stack is full return false; } top++; // Increment the top index data[top] = val; // Add the new element to the top of the stack return true; } bool pop() { if (top == -1) { // Stack is empty return false; } top--; // Decrement the top index to remove the top element return true; } bool peek(int& val) { if (top == -1) { // Stack is empty return false; } val = data[top]; // Return the top element without removing it. return true; } void display(ostream& out) { if (top == -1) { // Stack is empty out << "Empty stack" << endl; return; } for (int i = top; i >= 0; i--) { // Loop through the stack elements from top to bottom out << data[i] << ""; } out << endl; }
- 5. }; int main() { Stack S; int tmp; S.push (5); S. peek (tmp); cout << tmp << endl; S.push (33); S.push (1); S.push (7); S.peek (tmp); cout << tmp << endl; S.push (33) ; S.push (12); S.display ( cout ); S.pop ( ); S.display ( cout ); S.push (14); S.display ( cout ); S.pop ( ) ; S.pop ( ); S.display ( cout ); S.pop ( ); S. pop ( ) ; S.display ( cout ); S.peek (tmp); cout << tmp << endl; } #include using namespace std; const int MAXSIZE = 100; // Maximum size of the stack class Stack {
- 6. private: int top; // Index of the top element in the stack int data[MAXSIZE]; // Array to hold the stack elements public: Stack () { top = -1; // Initialize the top index to -1 to indicate an empty stack } bool push (int val) { if (top == MAXSIZE - 1) { // Stack is full return false; } top++; // Increment the top index data[top] = val; // Add the new element to the top of the stack return true; } bool pop() { if (top == -1) { // Stack is empty return false; } top--; // Decrement the top index to remove the top element return true; } bool peek(int& val) { if (top == -1) { // Stack is empty return false; } val = data[top]; // Return the top element without removing it. return true; } void display(ostream& out) {
- 7. if (top == -1) { // Stack is empty out << "Empty stack" << endl; return; } for (int i = top; i >= 0; i--) { // Loop through the stack elements from top to bottom out << data[i] << ""; } out << endl; } }; int main() { Stack S; int tmp; S.push (5); S. peek (tmp); cout << tmp << endl; S.push (33); S.push (1); S.push (7); S.peek (tmp); cout << tmp << endl; S.push (33) ; S.push (12); S.display ( cout ); S.pop ( ); S.display ( cout ); S.push (14); S.display ( cout ); S.pop ( ) ; S.pop ( ); S.display ( cout ); S.pop ( ); S. pop ( ) ; S.display ( cout ); S.peek (tmp); cout << tmp << endl;
- 8. }