a) Computational Time
b) Space Utilization
c) Space Utilization and Computational Time
d) Speed Utilization
Answer: c
Explanation: Linked lists saves both space and time.
Related Posts
Given an array of size n, let’s assume an element is ‘touched’ if and only if some operation is performed on it(for example, for performing a pop operation the top element is ‘touched’). Now you need to perform Dequeue operation. Each element in the array is touched atleast?
Which of the following sorting algorithms can be used to sort a random linked list with minimum time complexity?
What does the following function do for a given Linked List with first node as head?
void fun1(struct node* head)
{
if(head == NULL)
return;
fun1(head->next);
printf(“%d “, head->data);
}Which of the following points is/are not true about Linked List data structure when it is compared with an array?
In Linked List implementation, a node carries information regarding ___________
Linked list is considered as an example of ___________ type of memory allocation.
Linked lists are not suitable for the implementation of ___________
Join The Discussion