Consider an implementation of unsorted singly linked list. |||||Suppose it has its representation with a head and

Question:

Consider an implementation of unsorted singly linked list. |||||Suppose it has its representation with a head and tail pointer. 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 last node of the linked list 

A. I and II 

B. I and III 

C. I,II and III 

D. I,II and IV

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

Step by Step Answer:

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