《数据结构》复习（Data structure Review）.docVIP

《数据结构》复习（Data structure Review） Any economy is ultimately a matter of time saving. - Marx Data structure Review Fill in the blanks The main contents of the 1. data structure curriculum include, and three aspects. 2. the two important indexes of the evaluation algorithm in data structure are time complexity and space complexity. 3. a complete algorithm should have input, output, and 5 features. 4. in a length n of the sequence table element number I (1 i n), to move elements. 5. in a length n of the sequence table in section I (1 i n) into a new position, the need to move the n-i elements back. 6. if the linear table is inserted and deleted frequently, the chain storage structure should be adopted. 7. in the bidirectional cyclic list, insert the pointer to the node referred to by s before the node P refers to, and then execute the following statements in turn: s-rlink=p, s-llink=p-llink, p-llink=s;. 0 is the 8. space string length; the necessary and sufficient conditions of two strings of equal length is equal to _ is __. 9. set a two-dimensional array, A[5][6] in column priority storage in memory, known A[0][0] start address is 1000, each array element occupies 5 storage units, then the element A[4][4] address is. 10. the base address of the known two-dimensional array A[1..50,1..80] is 1000, each element occupies 2 storage units. If the order is stored in order, then the storage address of the element A[45,68] is; if the order is stored in a sequential order, then the storage address of the element A[45,68] is. The 11. is provided with an empty stack, push and pop represent a stack and the stack of stack respectively, assuming the stack sequence is 1,2, after 3, 4, 5, push, pop, after push, push, pop, push, push, the stack sequence is. The 12. set of n elements into the stack sequence of 1,2,3, N,..., stack sequence is P1, P2, P3,..., PN, if p1=n, then PI (1 in) value. 13., design a recursive algorithm for the problem of non recursive, usually need to set the data