Robert Bosch Arrays, Linked Lists, Trees, Graphs Quiz 2

In the worst case, number of comparisons are required to search for a specific element in a singly linked list of length n are n

A pointer to the previous node of last, which can only be acquired by traversing the list, is needed to delete the last element.
The size of the linked list is necessary for this.

Random Access of elements is not a linked list application

Search for each element of L1 in L2 to obtain the intersection of L1 and L2, then print the elements we locate in L2.
The union of L1 and L2 can be obtained in a variety of ways.
Printing all the nodes from L1 and only those that are absent from L2 is one of them.
Print the L2 nodes.
Since we must process the intersection node in addition to other nodes, all of these approaches will require more operations than intersection.

Can be done in O(1) by changing next of last and then last.

delete the previous node and then copy the data from it to the upcoming node. This method's time complexity is O (1)

In circular linked list, there is no beginning as well as no end.

Circular linked list can be traversed in both directions

Insertion at the middle node will affect 4 pointers whereas at the head or tail will affect only 2 pointers

Node in circular linked list doesnot contain null pointer