Planet Math Computer Science >
Planet Math Computer Science Collection >
Please use this identifier to cite or link to this item:
|Issue Date: ||18-Sep-2006 |
|Abstract: ||Given a stack, the act of adding a new element to the top of the stack is to ... push an element onto it. If there is a stack pointer, it would be incremented (or decremented if the bottom element of the stack is placed at the highest memory address available). To do this to a queue is usually called to ... enqueue .|
|Appears in Collections:||Planet Math Computer Science Collection|
All items in DSpace are protected by copyright, with all rights reserved.