Consider an implementation of unsorted singly 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 listii) Insertion at the end of the linked listiii) Deletion of the front node of the linked listiv) Deletion of the last node of the linked list - Study24x7
Social learning Network
17 Apr 2019 09:06 AM study24x7 study24x7

 Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head pointer only.
See more

A

I and II

B

I and III

C

I, II and III

D

I, II and IV

study24x7
Write a comment
Related Questions
500+   more Questions to answer
Most Related Articles