You
are given pointers to first and last nodes of a singly linked list,
which of the following operations are dependent on the length of the
linked list? ()
A: Delete
the first element
B: Insert
a new element as a first element
C: Delete
the last element of the list
D: Add
a new element at the end of the list
are given pointers to first and last nodes of a singly linked list,
which of the following operations are dependent on the length of the
linked list? ()
A: Delete
the first element
B: Insert
a new element as a first element
C: Delete
the last element of the list
D: Add
a new element at the end of the list
举一反三
- In a singly linked list which operation depends on the length of the list.( ) A: Interchange the first two elements of the list B: Delete the first element of the list C: Add an element before the first element of the list D: Delete the last element of the list
- The element is inserted first and will be removed last in _____________.( ) A: none of the above B: linked list C: queue D: stack
- Which<br/>of the following is true about linked list implementation of stack?<br/>() A: In<br/>push operation, if new nodes are inserted at the beginning of linked<br/>list, then in pop operation, nodes must be removed from end. B: In<br/>push operation, if new nodes are inserted at the end, then in pop<br/>operation, nodes must be removed from the beginning. C: Both<br/>of the above D: None<br/>of the above
- Which<br/>of the following operations is performed more efficiently by doubly<br/>linked list than by linear linked list? () A: Deleting<br/>a node whose location is given B: Searching<br/>an unsorted list for a given item C: Inserting<br/>a node after the node with a given location D: Traversing<br/>the list to process each node
- What<br/>is the condition that a single linked list with a header node is not<br/>empty ?Suppose the head pointer of the linked list is first. () A: first<br/>== NULL B: first->link<br/>== NULL C: first->link<br/>== first D: first->link<br/>== link