Consider an implementation of unsorted circular linked list. Suppose it has its representation with a head pointer

Question:

Consider an implementation of unsorted circular linked list. Suppose it has its representation with a head pointer only. Given the representation, which of the following operation can be implemented in O(1) time?

i. Insertion at the front of the linked list 

ii. Insertion at the end of the linked list 

iii. Deletion of the front node of the linked list 

iv. Deletion of the end node of the linked list 

A. I and II 

B. I and III 

C. I, II, III and IV 

D. None

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: