题目内容

16. In a doubly linked list, the operation to delete a node after the node p is ().

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

查看答案

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

更多问题

17. When a linear table is stored in () mode, it cannot access all other nodes from any node in the table.

A. singly linked lsit
B. doubly linked list
C. singly linked circular list
D. doubly linked circular list

查看答案

18.For a linear table requires not only to be able to insert and delete quickly, but also requires that the storage structure can reflect the logical relationship between data, you should use ().

A. sequential storage structure
B. linked storage structure
C. hash storage structure
D. all of the above is ok

查看答案

Both stacks and queues are ( ).

A Linear structure with restricted access points
B Sequentially stored linear structure
C Non-linear structure of linked storage
D Non-linear structure with restricted access points

查看答案

According to the order of six elements 6, 5, 4, 3, 2, 1 push into the stack, which of the following is not a legal sequence( ).

A 543612
B 453216
C 346521
D 234156

查看答案

16. In a doubly linked list, the operation to delete a node after the node p is ().

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

17. When a linear table is stored in () mode, it cannot access all other nodes from any node in the table.

18.For a linear table requires not only to be able to insert and delete quickly, but also requires that the storage structure can reflect the logical relationship between data, you should use ().

Both stacks and queues are ( ).

According to the order of six elements 6, 5, 4, 3, 2, 1 push into the stack, which of the following is not a legal sequence( ).

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