Structured_Implementation_of_STACK_ADT

[ac-ayan]

STACK ADT implementation using Linked List Have BASIC functions (1) PUSH (takes element from the user and stores in the stack) (2) POP (deletes the element at the top of the stack and shows the element deleted ) (3) DISPLAY (Displays according to the stack i.e Top element at the top and gradually to the lowest element of the stack at the bottom ) Example - INPUT : 1->2->3->4 OUTPUT : | 4 | | 3 | | 2 | | 1 |

[xlogix]

Thanks for contributing. Please contribute to an algorithm which hasn't been already in the repo.