SSL Certificate
  • The task this week is to complete the following 2 structures using a linked list Stack Queue

The task this week is to complete the following 2 structures using a linked list:


  • Stack
  • Queue


Assume the occurrence of a linked list node is represented by the object “Node” and its “Data” and “NextRef” attributes.


Part 1: Assume a “Head” node exists with the NextRef attribute pointing to the first node in the stack or being null if the stack is empty. Create pseudo code for the following 3 stack methods, showing the logic tied to the inverted list. Include a summary of these actions.  


push( item )
pop( )
display( )

Part 2: Assume “Front” and “Rear” nodes exist with the “NextRef” attributes pointing to the first and last nodes of the queue or being null if the queue is empty. Create pseudo code for the following 3 queue methods, showing the logic tied to the inverted list. Include a summary of these actions.


enqueue( item )
dequeue( )
display( )



Write a review

Please login or register to review

The task this week is to complete the following 2 structures using a linked list Stack Queue

  • $9.99


*All your data are SECURED & ENCRYPTED using a valid, trusted server certificate (Comodo SSL) and we don't store credit card information on our servers and all Payments are SECURED & handled by Paypal.
SSL CertificatePaypal

Related Products

Create an interface called Player

Create an interface called Player

Create an interface called Player . The interface has an abstract method called play () that display..

$9.99

Typically, the last action in a housekeeping method is

Typically, the last action in a housekeeping method is

Question 1  Typically, the last action in a housekeeping method is _________. closing a file op..

$9.99

Tags: queue, stack, part1, part2, push( item ), pop, display, enqueue( item ), dequeuer, Front, Rear, NextRef