题目内容

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

查看答案

Set the initial state of stack S and queue Q to be empty. Elements e1, e2, e3, e4, e5, and e6 push into the stack S in sequence. When an element is popped, it push into the queue Q immediately,if the pop sequence of 6 elements is e2, e4, e3, e6, e5, e1, then the capacity of stack S should be at least( ).

A 3
B 6
C 4
D 2

查看答案

Design an algorithm to judge whether the brackets in the discriminant expression match the occurrence, and the data structure using ( ) is the best.

A stack
B Sequence list
C Queue
D Linked 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 ( ).

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( ).

Design an algorithm to judge whether the brackets in the discriminant expression match the occurrence, and the data structure using ( ) is the best.

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