湖南人文科技学院·课程设计
Abstract
Stack is a data structure, in accordance with the LIFO principle
of data storage, the first to enter the data Ruzhan pressure at the end
of the final data in the Top-needed time to read data from the pop Top-
start data (the last data Was the first time out).
Stack is only one side of the insert and delete a special linear form.
Barrels per day by the accumulation of goods, the first reactor came
under pressure in, and then one by one to the heap. Away, can only take
one by one from above. Heap and check in at the top, usually at the
bottom of the fixed.
Stack is a similar accumulation of a barrel of items of data structure,
delete and insert one end of that Top, the other a pile at the end of
that stack. Commonly referred to as the insertion into the stack
(PUSH), then remove the back as the stack (POP). Stack also known as
Last In First Out Table (LIFO table).
Expression evaluation is a programming language compiler of the most
fundamental problem, it is the realization of the stack of applications
and a typical example. Here to introduce a simple and intuitive widely
used method, commonly referred to as "priority operator
Key words: data structure, stack, expression