![Mcqmate logo](https://mcqmate.com/images/logos/logo-black.png)
![Mcqmate logo](https://mcqmate.com/images/logos/logo-white.png)
McqMate
Q. |
Consider an implementation of unsorted doubly linked list. Suppose it has its representation with a head pointer and tail pointer. Given the representation, which of the following operation can be implemented in O(1) time?
|
A. | i and ii |
B. | i and iii |
C. | i,ii and iii |
D. | i,ii,iii and iv |
Answer» D. i,ii,iii and iv |
View all MCQs in
Data Structure and Algorithms (DSA)No comments yet