stack is a special type of linked list in which objects can only be
added to and removed from the top of the list.
举一反三
- 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
- Which one of the following is not a characteristic of the linked list? A: The node in a linked list can be accessed randomly B: Inserting or deleting a node in a linked list do not need to move the other nodes C: Don't have to estimate storage space in advance D: The memory space required by a linked list is in proportion to the length of the list.
- The element is inserted first and will be removed last in _____________.( ) A: none of the above B: linked list C: queue D: stack
- 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
- Which<br/>of the following operations is performed more efficiently by doubly<br/>linked list than by linear linked list? () A: Deleting<br/>a node whose location is given B: Searching<br/>an unsorted list for a given item C: Inserting<br/>a node after the node with a given location D: Traversing<br/>the list to process each node
内容
- 0
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
- 1
若通过List<br/>list = new List(); 创建的列表框,如何获得该列表框中当前选中的列表项(<br/>)。 A: list.getSelectedIndex() B: list. getSelectedItem( ) C: list. getItem (i) D: list. select (i)
- 2
What<br/>is the condition that a single linked list with a header node is not<br/>empty ?Suppose the head pointer of the linked list is first. () A: first<br/>== NULL B: first->link<br/>== NULL C: first->link<br/>== first D: first->link<br/>== link
- 3
In a doubly linked list, each node has links to the previous and next nodes in the list. A: 正确 B: 错误
- 4
6. The most common operation for setting a linked list is to insert a node at the end and delete the tail node, so () is the most time-saving option. A: doubly linked circular list with a head node B: singly linked list C: singly linked circular list with a tail pointer D: singly linked circular list