Data Structures, Algorithms
The Queue (Using a Linked List)

This applet demonstrates the basic operations on a queue implemented as a linked list.
Click the "Create" button to create an empty queue. Key in a value in the text field and click "Insert" button to push the value into the tail of the queue. Repeat the process to add a few elements to the queue. Click the "Delete" button to remove the element at the head of the queue. The peek operation reads the element at the head of the queue without removing it.

R. Mukundan
Department of Computer Science
University of Canterbury
Private Bag 4800, Christchurch
New Zealand.