Introduction - If you have any usage issues, please Google them yourself
Define single chain table class, chain stack class, sequence queue class.
2. The experiment verifies the correctness of the following algorithms, various functions and indicators.
1) single chain table insert operation: after the I element, insert a node with a value of X;
2) single chain table delete operation: delete the header node, the table tail node;
3) lookup operation: find the location of the element of X in the single chain table (a number of elements in the list);
4) pressure stack and missile stack operation;
5) out of the team and operation team.