Chapter 19, Problem 2PC

Program Plan Intro

Dynamic Stack Template

Program Plan:

Main.cpp:

• Include required header files.
• Inside the “main ()” function,
  • Create an object named “dstack” for stack.
  • Declare a variable named “popElem”.
  • Push 3 elements inside the stack using the function “push ()”.
  • Pop 3 elements from the stack using the function “pop ()”.

DynStack.h:

• Include required header files.
• Create a template.
• Declare a class named “DynStack”. Inside the class
  • Inside the “private” access specifier,
    • Give structure declaration for the stack
      • Create an object for the template
      • Create a stack pointer name “next”.
    • Create a stack pointer name “top”
  • Inside the “public” access specifier,
    • Give a declaration for a constructor.
      • Assign null to the top node.
    • Give function declaration for “push ()”, “pop ()”,and “isEmpty ()”.
• Give the class template.
• Give function definition for “push ()”.
  • Assign null to the new node.
  • Dynamically allocate memory for new node
  • Assign “num” to the value of new node.
  • Check if the stack is empty using the function “isEmpty ()”
    • If the condition is true then assign new node as the top and make the next node as null.
    • If the condition is not true then, assign top node to the next of new node and assign new node as the top.
• Give the class template.
• Give function definition for “pop ()”.
  • Assign null to the temp node.
  • Check if the stack is empty using the function “is_Empty ()”
    • If the condition is true then print “The stack is empty”.
    • If the condition is not true then,
      • Assign top value to the variable “num”.
      • Link top of next node to temp node.
      • Delete the top most node and make temp as the top node.
• Give function definition for “isEmpty ()”.
  • Assign Boolean value to the variable
  • Check if the top node is null
    • Assign true to “status”.
  • Return the status