forked from AhmadEnan/Data-Structures-Project-01
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmain.cpp
More file actions
45 lines (40 loc) · 1.48 KB
/
Copy pathmain.cpp
File metadata and controls
45 lines (40 loc) · 1.48 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
#include "LinkedList.h"
#include "Stack.h"
#include <iostream>
#include "Queue.h"
using namespace std;
int main() {
// ===== LinkedList Test ========================================
LinkedList list;
list.insertAtHead(10);
list.insertAtHead(20);
list.insertAtEnd(30);
std::cout << "Linked List after insertions: ";
list.display();
list.deleteValue(10);
std::cout << "Linked List after deleting 10: ";
list.display();
// ===== StackArray Test ========================================
std::cout << "\n--- StackArray Test ---\n";
StackArray stackArr(5);
stackArr.push(10);
stackArr.push(20);
stackArr.push(30);
std::cout << "Pushed 10, 20, 30.\n";
std::cout << "Top element (peek): " << stackArr.peek() << "\n";
std::cout << "Popped element: " << stackArr.pop() << "\n";
std::cout << "Is stack empty? " << (stackArr.isEmpty() ? "Yes" : "No") << "\n";
// ===== StackLinkedList Test ===================================
// ===== QueueArray Test ========================================
// ===== QueueLinkedList Test ===================================
QueueLinkedList q;
q.enqueue(5);
q.enqueue(30);
q.enqueue(1);
cout << "Queue content: ";
q.display();
cout << "Dequeue 1: " << q.dequeue() << endl; // Should print 5
cout << "Dequeue 2: " << q.dequeue() << endl; // Should print 30
cout << "Dequeue 3: " << q.dequeue() << endl; // Should print 1
cout << "Dequeue from empty queue: " << q.dequeue() << endl; // Should print -1
}