A linked structure, as compared to an array, has much faster insert and remove operations than an array, moreover, it does not require fixed size of memory space. 6. An array allows for more flexible memory management than a linked structure. An array does not require large contiguous memory blocks. 7. 8. In both array and linked structure implementations of stack, pushing a new item on a stack containing N elements takes linear time, O (N). 9. In the array implementation of list, adding a new element in a sorted list containing MN elements takes constant time, 0(1). 10. The time complexity of binary search algorithm with N sorted elements is O(logN)