In this program sort stack using temporary stack. To sort stack using temporary stack first one by one pop element from primary stack and push into temporary stack .If poped element is greater then top element of temporary stack then pop a element from temporary stack until the top element is greater than poped element …
In this program implement basic queue operations using stack Queue operations using stack like enqueue ,dequeue, display .For implement the queue operation use the two stack on primary stack and another temporary stack.A primary stack is used for store stack element and temporary stack is used for perform operation of queue.
In this program implements a basic queue operations using linked list. For enqueue operation use insert last operation of linked list and for dequeue operation use delete first operation of linked list.
In this program implement queue operations using array Enqueue operation is used to insert new element in queue from front.Dequeue operation remove and return element from the rear of the queue. Queue follow the first-in-first-out approach(FIFO).
In this program infix to prefix conversion using stack.This is one of the application of stack.Before Understand this program need to know about Stack operation for that check Below link.
In this program infix to postfix Conversion using stack.This is one of the application of stack.Before Understand this program need to know about Stack operation for that check Below link.
In this program evaluation of post-fix expression Evaluation of post-fix is one of the stack application.Before Understand this program need to know about Stack operation for that check Below link
