Extra Education
← All Data Structure and Algorithms (DSA) questions
1

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 lis

Correct Answer: i,ii and iii

Make the most of this question

This page focuses on one Data Structure and Algorithms (DSA) question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

← More Data Structure and Algorithms (DSA) MCQsAll Engineering topicsMock test hub
Data Structure and Algorithms (DSA) MCQ: 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 lis | Extra Education