2 flowcharts + pseudocode for each (at least 4 algorithms); Code for either a Stack or a Queue;

Basic data structures such as arrays are not sufficient for some applications. In some cases, more advanced data structures are more suitable. In this assignment you will examine Stacks and Queues using linked lists. Complete the following:

  • Create a flowchart to represent the Push and Pop operations for a Stack based on a linked list data structure.
  • Create a flowchart to represent the Enqueue and Dequeue operations for a Queue based on a linked list data structure.
  • Write the required Java code to implement either a Stack or a Queue data structure based on a linked list. The code should include the class constructors, the necessary properties, and methods to add and remove elements from the data structure. Do not use the built-in Java Stack class or the built-in Java Queue interface or the built-in Java linked list (you should create your own code for these classes).

Please submit your assignment in a single MS Word document:

Note: Diagrams created in separate programs should be copied and pasted into your document for submission.

"Is this question part of your assignment? We can help"