Description: The assumption that a one-way circle to indicate the queue list (that is, the cycle chain teams), which is only a team queue tail pointer, the first team with no indicators, test the preparation of the following computing algorithm: 1) to insert a cycle chain team element value of node x. 2) teams from the cycle of chain to remove a node. 3) Access Queue
To Search:
- [clist] - definition of a type of chain and Queue
File list (Check if you may need any files):
try03.cpp
Download