Implementation and Application 2.1 stack (1) the use of chain store to achieve stack initialization, stack, stack operation. (2) using sequential storage implementation initialize the stack, stack, stack operation. (3) Let expressions have been deposited in the form of a character array E [n], the ' #' symbol for the end of the expression, the expression in parentheses trial judge to write ' (' , ' )' , ' [' , ' ] ' is paired C language description of the algorithm. (4) Design a simple menu in the main function, namely to test these algorithms. Achieve 2.2 queue (1) the use of chain store to achieve initialization of the queue, into the team, a team operation. (2) using sequential storage implementation initialization cycle queue, into the team, a team operation. (3) Design a simple menu in the main function,

121340215 王诗尧 实验三.doc
2.cpp
3.cpp
4.cpp
1.cpp

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．