please who can help me v,i don't have enough time please please

those questions are single choice questions please i need the answers to fill this table

and those Also

10. What kind of tree has the property that the nodes along the path from the root to any node are in sorted order? ( A. binary search tree B.complete binary tree C.heap D. None of the above 11. To sort {.8.3.9. 11. 2, 1,4,7,5,10,6 } by Shell Sort, if we obtain (4.2.1, 8.3.5.10, 6,9,11,7), then the increment of this run is ()? A. 1 B. 2 C.3 D.5 12. In a directed graph, the relation between the sums of in-degrees Sin and out-degrees Sout of all the vertices is: (.? A. Sin=Sout B. Sin >= Sout = C. Sin Sout D. cannot be determined 13. Among the algorithms that sort by comparisons only, which method has its worst-case time complexity bounded above by O(NlogN)?: ( ) A. merge sort B. bubble sort C. quick sort D. shell sort 14. If a stack is used instead of a queue for the topological sort algorithm, does a different ordering result?. A. Yes, always. B. No, never. C. Yes, sometimes. D. None of the above. 15. To represent a graph with N vertices by the adjacency matrix, the size of the matrix must be? A. N-1 B. N C. (N-1)^2 D. N^2 16. Among the following problems, _ is NOT an NP-complete problem? A. Vertex cover problem B. Hamiltonian cycle problem C. Satisfiability problem D. Halting problem 10 11 12 13 14 15 16 3. For a sequentially stored linear list of length N, the time complexities for query and deletion are() A.O(1), O(1) B.O(N), O(1) C. O(1), ON) D.ON), ON) 4. Which boolean expression indicates the list with head point is empty. A. head == NULL B. head->next == NULL C.head->data == NULL D. head->data == 0 5. The height difference between left subtree and right subtree in a AVL tree can NOT be? ). A. 1 B. 0 C. -1 D. 2 6 Let T be a tree of N nodes created by union-by-size without path compression, then the minimum depth of T may be? ( ). A.1 Blog(N) C. N-1 D. N/2 7. A tree is the most suitable structure to represent: () A. soited elements B. elements with no direct relation C. unsoited elements D. elements with hierarchical branching relations 8. The minimum spanning tree of any connected weighted graph: () A. is unique B. is not unique c. may not be unique D. may not exist 9. To search a key in a complete binary search tree with N nodes, the average number of comparisons is: ( )? A. O(N) B. OlogN). C. O(NlogN) D. ON^2)