Introduction to the use of C++ stack

This article introduces the relevant knowledge of "introduction to the use of C++ Stack". In the operation of actual cases, many people will encounter such a dilemma, so let the editor lead you to learn how to deal with these situations. I hope you can read it carefully and be able to achieve something!

In the big field of development, C++ stack is a concept that can not be ignored, but many people, but some professionals who might as well do not make it clear that the stack is actually two kinds of data structures. in fact, a stack is a data structure in which data items are arranged in order.

You've noticed that I use the word "top". Yes, the top (top of the stack) is critical to the stack. The C++ stack only allows data to be added from the top, and exit / unstack is also from the top. It's that simple. So what happens when you use the stack? The stack is used in every process.

Each process has a stack, and data and addresses are taken out / added from the stack. The rules at the top of the stack are also consistent here. ESP Register adds a pointer to the top of the stack. In any case, explaining how the stack in the process works is beyond the scope of this tutorial, let's start writing about data structures. Before you begin, please remember some stack terms. Inserting a new element into the C++ stack becomes the stack, and removing the element from the stack becomes the off-stack.

The following is a reference clip:

# include using namespace std; # define MAX 10 / / MAXIMUM STACK CONTENT class stack {private: int arr [MAX]; / / Contains all the Data int top; / / Contains location of Topmost Data pushed onto Stack public: stack () / / Constructor {top=-1; / / Sets the Top Location to-1 indicating an empty stack} void push (int a) / / Push ie. Add Value Function {top++; / / increment to by 1 if (top {arr [top] = a; / / If Stack is Vacant store Value in Array} else {cout