We know stack is first in and last out. The first to go inside a stack is going to be the last to come out of it. So, the aloglrithm to convert a infix to postfix is simple. We print all the operands. Operands are something which are not mathematical symbols and does not represent […]
Implementing Stack Datastructure using arrays.
Stack is a way of accessing data, Last In First Out (LIFO). It has nothing to do with underlying memory structure, whether it is an array or a linked list or a tree or whatever. If you are accessing the data in LIFO fashion, then it is a stack. Stack is an abstraction, it is a concept […]