Data Structure Visualization - Queue-Linked List
Recommendation |
Has Potential |
||||
Link |
|||||
Delivery Method |
Java Application |
||||
License |
Unlicensed Sourcecode |
||||
Language |
English |
||||
Author |
David Galles |
||||
Institution |
University of San Francisco |
||||
Project |
|||||
Works |
Yes |
||||
Description |
A visualization of the enqueue and dequeue operations for a simple queue implemented using a singly linked list. |
||||
Evaluation |
The learner may choose the actions and the input. The movements are smoothly animated. There is a weakness in that the dequeue operation seems to indicate that the deleted link node just "goes away" which doesn't give the user any indication of the difference between properly handling the memory vs. having a memory leak. It might become tedious to manually enter what is essentially meaningless data values. |
||||
User Data |
|||||
Lecture Aid |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2006-09-01 |
||||
Last Visited |
2008-07-01 |
||||
Last Updated |
2006-04-05 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
