A: data
B: a link
C: a record
D: a and b
举一反三
- 单选题 () is a fixed-size, sequenced collection of elements of the same data type. A: An array B: A record C: A linked list D: A variable
- 单选题 An empty linked list consists of (). A: a variable B: two nodes C: data and a link D: a null head pointer
- 单选题 The () is a pointer that identifies the next element in the linked list. A: link B: node C: array D: a or b
- Q7 HashingQ7.1 Which critical operation is generally faster in a hash table than in a linked list?[img=673x100]18034cff9781dc9.png[/img] A: inserting an element into the data structure B: testing for the membership of an element in the data structure C: （无） D: （无）
- You<br/>are given pointers to first and last nodes of a singly linked list,<br/>which of the following operations are dependent on the length of the<br/>linked list? () A: Delete<br/>the first element B: Insert<br/>a new element as a first element C: Delete<br/>the last element of the list D: Add<br/>a new element at the end of the list
内容
- 0
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
- 1
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
- 2
The element is inserted first and will be removed last in _____________.( ) A: none of the above B: linked list C: queue D: stack
- 3
In the adjacency list of a directed graph, the number of nodes in each vertex singly linked list is equal to of the vertex. A: out_degree B: in_degree C: degree D: nothing
- 4
In a doubly linked list, each node has links to the previous and next nodes in the list. A: 正确 B: 错误