Welcome to the Balanced Stack simulation.
In Computer Science, a Stack is an abstract
Data Structure that allows adding and removing elements in a particular order.
Every time an element is added, it goes on the top of the Stack and the
only element
that can be removed is the element that is at the top of the Stack, just
like a pile of objects.
The basic implementation of a Stack is also called a LIFO(Last In First
Out) or FILO(First In Last Out) to demonstrate the way it accesses data.
There are many applications of the Stack data structure and even your computer's
CPU uses it to
manage memory efficiently.
For the purpose of this simulator, we will explore the Stack data structure to find out
whether
a given code is well formed.
In fact, it is possible to use a Stack not only to determine if the html code has the
correct number of opening and closing tags but also if the tags are opened and closed correctly.
Enough theory, let's get started with it !
