STARTING OUT WITH C++ REVEL >IA<
STARTING OUT WITH C++ REVEL >IA<
9th Edition
ISBN: 9780135853115
Author: GADDIS
Publisher: PEARSON
Question
Book Icon
Chapter 19, Problem 5RQE
Program Plan Intro

Stack:

A stack is type of container. It performs “Last In First Out”.

  • In stack, the item which is inserted at last will be retrieved first.
  • The elements can be inserted and retrieved at any one end of the stack.
  • There are two types of stacks. They are:
    • Static stack
    • Dynamic stack

Static Stack:

  • A static stack has fixed size.
  • The usual implementation is in the form of an array.
  • The starting size of the stack should be specified.
  • The elements cannot be added if the specified size is full.

Blurred answer
Students have asked these similar questions
What Operations Can Be Performed On Stacks?
How do the restricted and unbounded stacks differ?
Could you perhaps elaborate on the distinction between the bound and unbounded stacks?
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning