-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathmain.cpp
More file actions
78 lines (65 loc) · 2.37 KB
/
Copy pathmain.cpp
File metadata and controls
78 lines (65 loc) · 2.37 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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
#include "LinkedList.h"
#include "Stack.h"
#include <iostream>
#include "Queue.h"
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 ===================================
StackLinkedList stack;
std::cout << "\n--- StackLinkedList Test ---\n";
std::cout << "Is LL stack empty? " << stack.isEmpty() << std::endl;
stack.push(10);
stack.push(20);
stack.push(30);
std::cout << "Top after pushing 10, 20, 30: " << stack.peek() << std::endl;
std::cout << "Popped value: " << stack.pop() << std::endl;
std::cout << "Top after popping: " << stack.peek() << std::endl;
stack.push(40);
std::cout << "Top after pushing 40: " << stack.peek() << std::endl;
std::cout << "Stack values from top to bottom: ";
while (!stack.isEmpty()) {
std::cout << stack.pop() << " ";
}
std::cout << std::endl<<"\n";
// ===== QueueArray Test ========================================
QueueArray queue(5);
queue.enqueue(10);
queue.enqueue(20);
queue.enqueue(30);
std::cout << "Queue after insertions: ";
queue.display();
queue.dequeue();
std::cout << "Queue after dequeuing: ";
queue.display();
// ===== QueueLinkedList Test ===================================
QueueLinkedList q;
q.enqueue(5);
q.enqueue(30);
q.enqueue(1);
std::cout << "Queue content: ";
q.display();
std::cout << "Dequeue 1: " << q.dequeue() << std::endl; // Should print 5
std::cout << "Dequeue 2: " << q.dequeue() << std::endl; // Should print 30
std::cout << "Dequeue 3: " << q.dequeue() << std::endl; // Should print 1
std::cout << "Dequeue from empty queue: " << q.dequeue() << std::endl; // Should print -1
return 0;
}