fig deleting node from linked list finallythe sort operation is not applicable on linked lists efficient sorting algorithms require random access to list insertion sorta ( algorithmwould workbut it would be highly inefficient if sorting were requiredit would be much more efficient to copy the linked list to randomly accessible listsort itand then build new sorted linked list from the sorted list stacks and queues there are two other sequential data structures that are very common in computer programming stack is data structure where access is only at one end of the sequence new values are pushed onto the stack to add them to the sequence and popped off the stack to remove them from the sequence the run-time stackdescribed in chap was one such instance of stack stacks are used in many algorithms in computer science stacks can be used to evaluate numeric expressions they are useful when parsing information they can be used to match parenthesis in programs and expressions the operations on stack are given in fig stacks are called last in/first out or lifo data structures the last item pushed is the first item popped stack class can be implemented in at least couple different operation stack creation pop push top isempty complexity ( ( ( ( ( usage =stack( = pop( push(aa= top( isempty(description calls the constructor returns the last item pushed and removes it from pushes the itemaon the stacks returns the top item without popping returns true if has no pushed items fig complexity of stack operations this copy belongs to 'acha