subject: Data Structures and Algorithms

Q7. (a) (b) (Points 2+2+2+2+2) Give the worst case running time for each of the following in terms of N. Pop a value off a stack containing N elements implemented as an array, Insertion a data into a linked list Finding an item at position i in the array of size N? Traversing in a two-dimensional array of order m xn Preorder traversing without recursion a (e)