Implementing a Stack in Rust.
Stacks belong to the commonly used data structures especially when implementing optimized algorithms. There entire philosophy rely on the so called LIFO principle (Last In First Out). This actually already describes most of the mechanism behind a stack.
- let’s you put an element to it: push
- let’s you remove and receive the last put element: pop