is convenient 8. Which is the advantage of the parents representation for tree A Finding the specific node's parent node B Finding the specific node's children nodes C Finding the specific node's brothers nodes D Judging whether the specific node is leaf or not 9. For the undirected graph G with n vertices, if it is represented by the adjacent matrix, then the matrix size is 0. If the binary tree is stored by the sequential method, which operation is easy to implement? A Preorder traversal B Judge if the node is on the same level C Hierachical traversal D Find the node position according to its value I Answer area Il True or False ( 10 POINTS) 1. Abstractive data type is not related to representation and implementation in computer 2. The insertion and deletion efficiency is lower for sequential storage, so it is worse than linked storage; 3. Sequential storage is only used for linear structure; 4. Every node in linear list has one precusor and successor 5. In the tree structure, there is one precursor node for every node. 6. There is at least one node with the degree 2 in the n (n>2) nodes binary tree 7. In the directed graph, the sum of vertices in-degree equals to that of out-degree directed grayh 8. Ifone directed graph's adjacent matrix is symmetric, then it must be complete di 9. In the tree with the degree m, there is at least one node with the degree m, and no wwle with tve degree over m the same level 10. In tree structure, there is sibling relationship among every nodes in I Answer area 2 1II Answer ( 70 POINTS 1. Define an integer array X(7I4IS], the first element address is 100.(10 points) () The number of elements in the array X[7[4S? 2) Each integer occupies 4 bytes. Then calculate memory address of the following elements xrononol: x(1)(1)(1); x(3)(1)(2); x14)|21131