Write a structure to represent a Node in a singly linked-list-based stack similar to the one discussed in class. Your stack will store integer values. Your program will read a series of integers (until the user enters a non-integer) and store them in a stack, then print them in the rever se order; You will write three functions to assist with this task: push, print Stack, and deleteSt ack. The function push takes a number and a Node and adds the number to the head (top) of the stack by creating a new Node (using malloc) and returning a pointer to this Node. This new node is now the top of your st ack.

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.