1.

Consider a linked list of n elements. What is the time taken to insert an element after an element pointed by some pointer?

A. O (1)
B. O (log n)
C. O (n)
D. O (n log n)
Answer» B. O (log n)


Discussion

No Comment Found