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: （无）
A: inserting an element into the data structure
B: testing for the membership of an element in the data structure
C: （无）
D: （无）
举一反三
- 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
- 单选题 In a linked list, each element contains (). A: data B: a link C: a record D: a and b
- 2 In the data structure, from the storage structure can be divided into ( ). A: dynamic structure and static B: sequential structure and linked structure C: compact structure and non-compact structure D: linear and nonlinear structures
- 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
- The linked list is a linear structure adopting the storage of . A: sequential structure B: linked structure C: star structure D: net structure