网友您好, 请在下方输入框内输入要搜索的题目:
题目内容
(请给出正确答案)
判断题
数据结构里,栈的特性是后进先出(Last In First Out)又叫LIFO表。
A
对
B
错
参考答案
参考解析
解析:
暂无解析
更多 “判断题数据结构里,栈的特性是后进先出(Last In First Out)又叫LIFO表。A 对B 错” 相关考题
考题
One attribute of the stack is(72).A.FIFO( First In First Out)B.LIFO( Last In First Out)C.queueD.built into their circuitry
考题
A(71)is a data type whose major attributes are determined by the roles governing the insertion and deletion of its elements. The only element that can be deleted or removed is the one that was inserted most(72). Such a structure is said to have a last-in/first-out(LIFO)behavior, or protocol.A.stackB.queuesC.pointerD.record
考题
栈的特性是后进先出又称为LIFO表,那么后进先出的英文是()。A、First In Last OutB、First In First OutC、Last In Last OutD、Last In First Out
考题
单选题栈的特性是后进先出又称为LIFO表,那么后进先出的英文是()。A
First In Last OutB
First In First OutC
Last In Last OutD
Last In First Out
考题
单选题数据结构里,栈是操作受限的线性表,插入和删除都在()完成。A
栈顶B
栈底C
栈中D
栈外
热门标签
最新试卷