判断题数据结构里，栈的特性是后进先出（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表，那么后进先出的英文是（）。AFirst In Last OutBFirst In First OutCLast In Last OutDLast In First Out
单选题数据结构里，栈是操作受限的线性表，插入和删除都在（）完成。A栈顶B栈底C栈中D栈外