第五章A linear list of data elements where each element called node is given by means of pointer is called
node list
queue
stack
答案:linked list
Consider an implementation of unsorted singly linked list. Suppose it has representation which a head pointer only. Given the representation, which of the following operation can be implemented in O(1) time?(I). Insertion at the front of the linked list.(II). Insertion at the end of the linked list.(III). Deletion of the front node of the linked list.(IV). Deletion of the last node of the linked list.
I, II, and IV
I and II
I and III
What is the time complexity to count the number of elements in the linked list?
O(1)
O(n)
O(log n)
In which of the following linked lists there are no NULL links?
None of the above
Circular linked list
Singly linked list
In doubly linked lists, traversal can be performed?
In both directions
Only in reverse direction
None
What kind of list is best to answer questions such as : “What is the item at position n?”
List implemented with an array
Singly-linked lists
Doubly-linked lists
In a singly linked list which operation depends on the length of the list.
Interchange the first two elements of the list
Delete the last element of the list
Add an element before the first element of the list
The link field in a node contains:
address of the next node
data of next node
data of previous node
Linked list data structure offers considerable saving in:
Space utilization
Computational time
A linear list in which each node has pointers to point to the predecessor and successors nodes is called as:
Circular linked list
Doubly-linked lists
Singly-linked lists
温馨提示支付 ￥3.00 元后可查看付费内容,请先翻页预览!
