数据结构温习题-第3章谜底2014-6-16(国外英文资料).docVIP

数据结构复习题-第3章答案2014-6-16(国外英文资料) Chapter 3 stacks and queues The answer: A, multiple choice 1-5 BCBCB 6-10 BCCDD 11-15 BDBBD, 16-20 CCBDB In general, you only need to change the header of the team, but when there is only one node in the queue, you need to modify the tail pointer at the same time. Second, the true or false 1 minus 5 times the square root of 6 minus 10 times the square root of the square root of the square root of the square root of the square root of the square root of the square root of the square root of the square root of the square root of the square root of the square root of the square root of Third, fills up the topic Stack top, stack bottom 2. Stack, stack 3. Queue, advanced first out 4. Stack 5. Queue 6. First in first out 7. (R - P + N) 8. % N, N - 1 at the expense of a storage unit, shall mark the bottom of the stack, two adjacent stack pointer (that is, the absolute value of the difference between the value of 1) No, 1, 2. Data domain, pointer field 3. Front drive 4. Forward, follow-down, 6 7. Endless chain table 8. 9. N - 1 stack lifo 10. SXSSXSXX 11.3, 1, 2, 12. Sacrifice a storage unit set mark 13. The bottom of the stack The difference between the adjacent two stack pointer (that is, the value of absolute value of 1) The short answer (5 points, 10 points) Describe the similarities and differences between the two types of data, the queue and the stack. A: the queue and stack are both operating constrained linear tables, which are the logical structures of the linear table. The difference is that the insertion of the queue is done at the end of the queue, and the deletion is done at the end of the queue; The stack inserts and deletes can only be done at the top of the stack. Describe the difference between a stack and a linear table. A: the stack is a linear table with restricted operations, and the insertion and removal of the stack can only be done at the top of the stack, and thus the corresponding push stack and exit stack. Explain t