Consider a linked list of length n is implemented using a circular array P[0, n - 1], two variables first and last are used to point the first and last element of the list present in array respectively i.e., first = P and last = (P + x) mod n, where x is the size of linked list ... represent the time complexity of above two operations respectively? O(n), O(n) O(n), O(1) O(1), O(1) O(1), O(n)

answered
Nov 24, 2017
in DS
411 views