s children nodes Finding the specific od\'sbothers DAodging whether the specifie

Question

s children nodes Finding the specific od'sbothers DAodging whether the specifie node is leaf or by the adjacent matrix, then the matrix gr Gwith n vertices, t is 10. Ifthe binary tree is stored by the Judge if the node is on the same level D Find the node position acording to its eenial method, which operation is easy to implement? 10 l Answer are Il True or False ( 10 POINTS) 2. The insertion and deletion 3. Sequential storage 4. Every node in linear list has one precusor 5. In the tree structure, there is one precursor is not related to representation and implementation in computer is only used for linear structure; efficiency is lower for sequential storage, so it is worse than linked storage; one precusor and successor; There is at least one node with the degree 2 in node for every node. 6. 7. In the directed graph, the sum 9. In the 10. In tree structure, vertices of vertices in-degree equals to that of out-degree. graph's adjacent matrix is symmetric, then it must be complete directed legre ove t the degree m, there is at least one node with the degree m, and no node with the degree over m. tree with II Answer area there is sibling relationship among every nodes in the same level. 10 Answer ( 70 POINTS ) 1. Define an integer array X[7]/4]5], the first element address is 100. ( 10 points) (I) The number of elements in the array XI7)4115]? (2) Each integer occupies 4 bytes. Then calculate memory address of the following elements xIOIOIOI; xt1][1][11; x(3][1][21; x14][2][3]

Explanation / Answer

Question 8:

Question 9:

In an undirected graph, there is a probability that an edge exists between every pair of vertices. Therefore, if it has n vertices then it is necessary to have an n * n matrix to represent the graph using adjacency matrix. Option (d) is correct.

Question 10:

Preorder traversal will be easy to implement because we don’t have to search for node’s position, we can just traverse the tree and place the nodes sequentially. Option (a) is correct.

II. True or False.

Related Questions

Navigate

• Browse (All)
• Browse S
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.