1.

Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head pointer only.

A. time?
B. Insertion at the front of the linked list
C. Insertion at the end of the linked list
D. Deletion of the front node of the linked list
Answer» C. Insertion at the end of the linked list


Discussion

No Comment Found

Related MCQs