(data structure)
Definition: A stack limited to a fixed number of items.
See also bounded queue.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 17 December 2004.
HTML page formatted Mon May 11 15:07:56 2026.
Cite this as:
Paul E. Black, "bounded stack", in
Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY)
Available from: /HTML/boundedstack.html