题目内容

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)

查看答案

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

更多问题

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;

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;

A. n
B. 2n-1
C. 2n
D. n-1

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