Data Structures & Algorithms
Testing Your Queue
QueuesIf you build out your own queue, use this main function to test your code to ensure everything is working properly:
#include "QueueUsingStacks.h"
using namespace std;
int main() {
QueueUsingStacks queue;
// Test enqueue operation
queue.enqueue(1);
queue.enqueue(2);
queue.enqueue(3);
cout << "After enqueue operations:\n";
queue.display();
// Test dequeue operation
cout << "Dequeued: " << queue.dequeue() << "\n";
cout << "After one dequeue operation:\n";
queue.display();
// Test front operation
cout << "Front of the queue: " << queue.front() << "\n";
// Test more enqueue and dequeue operations
queue.enqueue(4);
queue.enqueue(5);
cout << "After adding more elements:\n";
queue.display();
cout << "Dequeued: " << queue.dequeue() << "\n";
cout << "Dequeued: " << queue.dequeue() << "\n";
cout << "After two more dequeue operations:\n";
queue.display();
// Test isEmpty
cout << "Is the queue empty? " << (queue.isEmpty() ? "Yes" : "No") << "\n";
return 0;
}Members only
Keep reading this lesson
You've reached the end of the free preview. Unlock the rest of this lesson plus 42 more lessons in Data Structures & Algorithms.
- Unlimited coding questions
- Unlimited access to all classroom material
- Weekly live call for questions and guidance
- 3,000 AI tutor tokens / month
- Personal SQL database (3 MB)
- Progress tracking
Cancel any time.