题目内容

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

查看答案

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

更多问题

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

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

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

A. s->next=p->next;p->next=s;
B. p->next=s;s->next=p->next;
C. p->next=s;p->next=s->next;
D. p->next=s->next;p->next=s;