Consider an implementation of unsorted singly linked list. Suppose it has its…

PYQ eLitmus 2023

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 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

  1. A.

    I and II

  2. B.

    I and III

  3. C.

    I, II and III

  4. D.

    I, II and IV

Attempted by 474 students.

Sign up free to check your answer

Sign up free

Explore the full course: Cdac C Cat Complete Preparation

Loading lesson…