The element is inserted first and will be removed last in _____________.( )
A: none of the above
B: linked list
C: queue
D: stack
A: none of the above
B: linked list
C: queue
D: stack
举一反三
- Which<br/>of the following is true about linked list implementation of stack?<br/>() A: In<br/>push operation, if new nodes are inserted at the beginning of linked<br/>list, then in pop operation, nodes must be removed from end. B: In<br/>push operation, if new nodes are inserted at the end, then in pop<br/>operation, nodes must be removed from the beginning. C: Both<br/>of the above D: None<br/>of the above
- You<br/>are given pointers to first and last nodes of a singly linked list,<br/>which of the following operations are dependent on the length of the<br/>linked list? () A: Delete<br/>the first element B: Insert<br/>a new element as a first element C: Delete<br/>the last element of the list D: Add<br/>a new element at the end of the list
- In a singly linked list which operation depends on the length of the list.( ) A: Interchange the first two elements of the list B: Delete the first element of the list C: Add an element before the first element of the list D: Delete the last element of the list
- A<br/>stack is a special type of linked list in which objects can only be<br/>added to and removed from the top of the list.
- 采用先进先出存储结构的集合是（ ）。 A: Stack B: List C: Queue D: Collection