A. The ADT table (abstract data types)
1.remove method is to adjust the next quote
Delete the last one is more complicated, because the chain stores only one node after node, and delete the last one of the nodes need to find out all references to the last one, and next to null
2.Insert method requires a new operator takes a new node from the system, by reference to two adjustments
Inserting data array, if the data is inserted into the front, to the back of the overall shift elements, relatively large overhead
3. doubly linked list: After a node while a node pointing to the front
4. FIFO stack ADT STACK
Is called the top end of the table top of the stack, the operation with a push (push) POP (pop), delete the last element into the