题目内容

3. If the most common operation of a linear table is to access any element with specified sequence number and insert and delete at the end of the operation, the () storage method is the most time-saving

A. sequence table
B. doubly linked list
C. doubly linked circular list with a head node
D. singly linked circular list

查看答案

搜索结果不匹配？点我反馈

更多问题

6. The most common operation for setting a linked list is to insert a node at the end and delete the tail node, so () is the most time-saving option.

A. doubly linked circular list with a head node
B. singly linked list
C. singly linked circular list with a tail pointer
D. singly linked circular list

查看答案

7. The pointer in the static linked list represents ().

A. the address of the next element
B. memory address
C. array subscript
D. address of the left child and the right child

查看答案

8. If the linear table with length n uses the sequential storage structure, the time complexity of the algorithm of inserting a new element in its ith position is ().

A. O(n)
B. O(0)
C. O(1)
D. O(n^2)

查看答案

9. For the sequence table, the time complexity of accessing and deleting nodes are ().

A. O(1) O(n)
B. O(n) O(n)
C. O(n) O(1)
D. O(1) O(1)

查看答案

3. If the most common operation of a linear table is to access any element with specified sequence number and insert and delete at the end of the operation, the () storage method is the most time-saving

A. sequence table B. doubly linked list C. doubly linked circular list with a head node D. singly linked circular list

6. The most common operation for setting a linked list is to insert a node at the end and delete the tail node, so () is the most time-saving option.

7. The pointer in the static linked list represents ().

8. If the linear table with length n uses the sequential storage structure, the time complexity of the algorithm of inserting a new element in its ith position is ().

9. For the sequence table, the time complexity of accessing and deleting nodes are ().

A. sequence table
B. doubly linked list
C. doubly linked circular list with a head node
D. singly linked circular list