-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathProjectMain.java
More file actions
304 lines (283 loc) · 13.2 KB
/
ProjectMain.java
File metadata and controls
304 lines (283 loc) · 13.2 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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
import java.util.Scanner;
public class ProjectMain {
/**
* main method
* @param args
*/
public static void main(String[] args) {
//instantiating the data structures
LinkedList list = new LinkedList();
Stack stack = new Stack();
Queue queue = new Queue();
MinHeap minHeap = new MinHeap(100);
BinarySearchTree BST = new BinarySearchTree();
Scanner scan = new Scanner(System.in);
System.out.println("Program: Please select the data structure you want to work with: ");
//if user enters 1,2,3,4 or 5 the program will continue, if not the user will have to re-enter again.
String input;
while (true) {
System.out.println("Enter 1 for Linked List");
System.out.println("Enter 2 for Stack");
System.out.println("Enter 3 for Queue");
System.out.println("Enter 4 for Min Heap");
System.out.println("Enter 5 for Binary Search Tree (BST)");
input = scan.nextLine();
if (input.equals("1")) {
System.out.println("You've selected: Linked List");
break; //end the while loop if user enters "1"
}
if (input.equals("2")) {
System.out.println("You've selected Stack.");
break; //end the while loop if user enters "2"
}
if (input.equals("3")) {
System.out.println("You've selected Queue.");
break; //end the while loop if user enters "3"
}
if (input.equals("4")) {
System.out.println("You've selected Min Heap");
break; //end the while loop if user enters "4"
}
if (input.equals("5")) {
System.out.println("You've selected Binary Search Tree (BST)");
break; //end the while loop if user enters "5"
}
else {
System.out.println();
System.out.println("Invalid input, please try again.");
}
}
//Linked List
if (input.equals("1")) {
while (true) {
System.out.println();
System.out.println("What do you want to do with the Linked list?");
System.out.println("1. Add Data");
System.out.println("2. Remove Data");
System.out.println("3. Display Linked List");
System.out.println("4. Exit");
System.out.println();
System.out.print("Enter your choice (1/2/3/4): ");
input = scan.nextLine();
switch (input) {
case "1":
System.out.print("Enter the data to add to the Linked List (-1 to end) ");
int inputData = Integer.parseInt(scan.nextLine());
while (inputData != -1) {
//create a new node with the input data
Node newNode = new Node(inputData);
list.insertAfter(newNode); //insert the new node into the linked list
System.out.print("Enter the data to add to the Linked List (-1 to end) ");
inputData = Integer.parseInt(scan.nextLine());
}
break;
case "2":
while (true) {
System.out.print("Enter the data to remove from the linked list (-1 to end): ");
int key = Integer.parseInt(scan.nextLine());
if (key == -1) {
break;
}
list.deletion(key);
}
case "3":
System.out.println();
System.out.println("Your Linked List looks like this: ");
list.display();
break;
case "4":
System.out.println("You've exited the program.");
return; //exit the program
default:
System.out.println();
System.out.println("Invalid choice. Please enter a valid option (1-4 ).");
break;
}
}
}
//Stack
if (input.equals("2")) {
while (true) {
System.out.println();
System.out.println("What do you want to do with the Stack?");
System.out.println("1. Push Element");
System.out.println("2. Pop Element");
System.out.println("3. Top Element");
System.out.println("4. Display Stack");
System.out.println("5. Exit");
System.out.println();
System.out.println("Enter your choice (1/2/3/4/5): ");
input = scan.nextLine();
System.out.println();
switch (input) {
case "1":
System.out.print("Enter the data to push onto the Stack (-1 to end) ");
int inputData = Integer.parseInt(scan.nextLine());
while (inputData != -1) {
stack.push(inputData);
System.out.print("Enter the data to push onto the Stack (-1 to end) ");
inputData = Integer.parseInt(scan.nextLine());
}
break;
case "2":
int error = stack.pop();
if(error == -1){
System.out.println("Checking if this works");
}
else {
System.out.println("Popped element: " + stack.pop());
}
break;
case "3":
System.out.println("Top element: " + stack.top());
break;
case "4":
System.out.println();
stack.display();
break;
case "5":
System.out.println("You've exited the program!");
return; //exit the program
default:
System.out.println();
System.out.println("Invalid choice. Please enter a valid option (1-5).");
break;
}
}
}
//Queue
if (input.equals("3")) {
while (true) {
System.out.println();
System.out.println("What do you want to do with the Queue? ");
System.out.println("1. Enqueue");
System.out.println("2. Denqueue");
System.out.println("3. Display Queue");
System.out.println("4. Exit");
System.out.println();
System.out.print("Enter your choice (1/2/3/4): ");
input = scan.nextLine();
System.out.println();
switch (input) {
case "1":
System.out.print("Enter the data to enqueue (-1 to end) ");
int inputData = Integer.parseInt(scan.nextLine());
while (inputData != -1) {
queue.enqueue(inputData);
System.out.print("Enter the data to enqueue (-1 to end) ");
inputData = Integer.parseInt(scan.nextLine());
}
break;
case "2":
System.out.println("Dequeled element: " + queue.dequeue());
break;
case "3":
System.out.println();
queue.display();
break;
case "4":
System.out.println("You've exited the program!");
return; //exit the program
default:
System.out.println();
System.out.println("Invalid choice. Please enter a valid option (1-4).");
break;
}
}
}
//Min Heap
if (input.equals("4")) {
while (true) {
System.out.println();
System.out.println("What do you want to do with the Min Heap?");
System.out.println("1. Insert");
System.out.println("2. ExtractMin");
System.out.println("3. Exit");
System.out.println();
System.out.println("Enter your choice (1/2/3): ");
input = scan.nextLine();
switch (input) {
case "1":
System.out.print("Enter the key to insert into the Min Heap (-1 to end): ");
int inputKey = Integer.parseInt(scan.nextLine());
while (inputKey != -1) {
minHeap.insert(inputKey);
System.out.print("Enter the key to insert into the Min Heap (-1 to end): ");
inputKey = Integer.parseInt(scan.nextLine());
}
break;
case "2":
System.out.println();
System.out.println("Min element extracted: " + minHeap.extractMin());
break;
case "3":
System.out.println("You've exited the program!");
return; //exit the program
default:
System.out.println();
System.out.println("Invalid choice. Please enter a valid option (1-3).");
break;
}
}
}
//BST
if (input.equals("5")) {
while (true) {
System.out.println();
System.out.println("What do you want to do with the BST?");
System.out.println("1. Insert Node");
System.out.println("2. Delete Node");
System.out.println("3. Find Node");
System.out.println("4. Inorder Traversal");
System.out.println("5. Exit");
System.out.println();
System.out.print("Enter your choice (1/2/3/4/5): ");
input = scan.nextLine();
switch (input) {
case "1":
System.out.print("Enter the key to insert into the BST (-1 to end): ");
int inputKey = Integer.parseInt(scan.nextLine());
while (inputKey != -1) {
BST.insert(inputKey);
System.out.print("Enter the key to insert into the BST (-1 to end): ");
inputKey = Integer.parseInt(scan.nextLine());
}
break;
case "2":
System.out.print("Enter the key to delete from the BST (-1 to end): ");
int keyDelete = Integer.parseInt(scan.nextLine());
while (keyDelete != -1) {
BST = BST.delete(keyDelete);
System.out.print("Enter the key to delete from the BST (-1 to end): ");
keyDelete = Integer.parseInt(scan.nextLine());
}
break;
case "3":
System.out.print("Enter the key to find in the BST: ");
int keyToFind = Integer.parseInt(scan.nextLine());
BinarySearchTree foundNode = BST.find(BST, keyToFind);
if (foundNode != null) {
System.out.println("Node found in the BST");
}
else {
System.out.println("Node NOT found in the BST");
}
break;
case "4":
System.out.println();
System.out.println("Inorder Traversal of the BST: ");
BST.inOrder();
break;
case "5":
System.out.println();
System.out.println("You've exited the program!");
return; //exit the program
default:
System.out.println();
System.out.println("Invalid choice. Please enter a valid option (1-5).");
break;
}
}
}
}
}