Description: Stack implementation. Stack is such a data structure. It was opened in memory a storage area, the data one by one sequentially deposited (ie " push- push" ) into this area. There is an address pointer always points to the last one where the data is pushed onto the stack data unit, the address pointer stored is called the stack pointer register. Start the data into a unit called the " bottom of the stack." Data stored in one by one, this process is called " push." In the push process, each having a data onto the stack, and the previous one is placed behind the unit is connected to a unit, the stack pointer in the address is automatically incremented by 1. Read the data, in accordance with the address of the stack pointer in the read data, the number of addresses in the stack pointer is decremented by one. This process is called " pop pop" . So to achieve a LIFO principle.
To Search:
File list (Check if you may need any files):
Stack.cpp
Download