Review the 7 points of the stack ADT

1. Simply put, the stack is a table for inserting and deleting operations in one place, and this particular position is the end of the table, but this is not the end of the stack, but the top.

2. Stack in the basic operation of the stack and the stack, the English name is push and pop, respectively, equivalent to insert and delete. Remember that pop and top operations on empty stacks are considered wrong on stack ADT, and if push is implemented outside of space there are implementation restrictions, but this is not an ADT error.

3. The characteristics of the stack is the last-in, first-out, for students may be piled up in the canteen to describe more suitable dishes.

4. Stacks can be implemented either with a one-way linked list or by an array. It is relatively simple to use one-way linked list, but it is relatively simple to use an array to achieve it, since it can be _back with the back, push_back and pop of the vector. And with the array, each stack will have a thearray and topofstack, for the empty stack this topofstack is-1, if you want to add an element x, then Topofstack plus 1, and thearray[topofstack]=x. If you want to delete an element x, then the return value of the POP function is Thearray[topofstack], and remember to subtract the Topofstack by 1.

5. The above operation is very fast, and if there is a self-increment and self-reduction of the function of the register, then the whole number of push and pop operations can be written as a machine instructions oh.

6. The information stored is referred to as the activity record, or the stack frame.

7. About recursion, if you are interested, you can look at this article, it is very likely to expand your knowledge.

Portal: "Scheme induction" 3 comparison do, let, loop

Review the 7 points of the stack ADT