Implementations and demonstrations of the Stack ADT in different languages. Each example of the Stack ADT can be located in each language's properly named directory. I've also listed the development program for each language below.

Supported Languages:

• Java (developed in NetBeans)
• Lua (developed in Sublime Text)
• C (developed in Code::Blocks)

Planned Languages:

• C++
• C#

The Stack is an abstract data type that collects elements in a lingear order with two primary operations, push() and pop(). Elements are pushed onto the Stack and can only be popped out of the Stack in the reverse order in which they were added. This is called LIFO (last in, first out) ordering. Other operations peek() or top() may be used to see if the Stack is empty by checking to see if the top element of the Stack is empty.

Learn more at: https://en.wikipedia.org/wiki/Stack_(abstract_data_type)