"In data structure, a stack follows a particular order according to which operations are performed. It has two ends, front and rear where the queue starts and ends. Think about a set of plates arranged one above another, the topmost plate will be first removed. Like wise, it follows LIFO (Last In First Out) principle. The last plate is removed first and bottom most plate will be removed last. Its an abstract data type, elements with a limited size can be stored. Filled up from the bottom, for any operation to get performed, there is only one way of entry. First entered value will be removed last. Some common operations implemented are: push, to insert an element into the stack. Pop is used to delete an element and is empty command indicates the stack is empty. Applications of stack are balancing of symbols, string reversal, recursion, backtracking, expression conversion and memory management. More information about the topic can be understood from the powerpoint presentation."

Suriya Stephen

46 resources

0

1

0

Like