Lists, Stacks, and Queues

Deliverable Length:  2 pseudo jurisprudences
APA cemat with references
Data Structures Using Java instrument shell
Use Microsoft Word

The toil this week is to finished the aftercited 2 structures using a linked inventory:

Stack
Queue
Assume the affair of a linked inventory node is represented by the motive “Node” and its “Data” and “NextRef” manifestations.

Part 1: Assume a “Head” node rests with the NextRef manifestation pointing to the pristine node in the stack or nature vain if the stack is space. Create pseudo jurisprudence ce the aftercited 3 stack methods, showing the logic tied to the inverted inventory. Include a digest of these actions.  
push( individual )
pop( )
display( )
Part 2: Assume “Front” and “Rear” nodes rest with the “NextRef” manifestations pointing to the pristine and conclusive nodes of the queue or nature vain if the queue is space. Create pseudo jurisprudence ce the aftercited 3 queue methods, showing the logic tied to the inverted inventory. Include a digest of these actions.

enqueue( individual )
dequeue( )
display( )
Week 1 Deliverables:

Pseudo jurisprudence implemented ce twain the stack and queue methods
Documented pseudo jurisprudence