The concatenation of two lists can be performed in O(1) time. Which o – McqOptions

MCQOPTIONS

1.	The concatenation of two lists can be performed in O(1) time. Which of the following variation of the linked list can be used?
A.	Singly linked list
B.	Doubly linked list
C.	Circular doubly linked list
D.	Array implementation of list
Answer» D. Array implementation of list

Discussion

No Comment Found

Related MCQs

Consider the following definition in c programming language. Which of the following c code is used to create new node?
The concatenation of two lists can be performed in O(1) time. Which of the following variation of the linked list can be used?
What would be the asymptotic time complexity to find an element in the linked list?
What would be the asymptotic time complexity to insert an element at the front of the linked list (head is known)?
In linked list each node contains a minimum of two fields. One field is data field to store the data second field is?
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?
A linear collection of data elements where the linear node is given by means of pointer is called?
What is the functionality of the following piece of code?
Which of these is not an application of a linked list?
What is the space complexity for deleting a linked list?