I know this is a lot, but your help is highly aappreciated and thank you for you

Question

I know this is a lot, but your help is highly aappreciated and thank you for your help.

Hi I have some questions but I dont know them. Please help me on this thank you for your help 1. Which statement is NOT true The order of Heapify0 is O(log n) The order of building a Max-Heap from a binary tree is O(n) The order of the average heapsort is O(n log n) The order of removing the max value from a Max-Heap is O(log n) 2. Which edges, and in which order, are selected by Kruskal's algorithm? 3. How many binary search trees containing the keys 1, 2, 3, 4 can be built such that either 2 or 3 is the root and an inorder traversal of the tree visits the node with key 1 first? 4. Using Dijkstra's algorithm to find the shortest path from node 1 to all other vertices, which node is the last one to be declared known? node 4 node 5 node 6 node 7 5. Using divide-and-conquer technique if we know X, what is the minimal number of multiplications we need to compute X02 (Hint: XX-XN2* XN2 is one multiplication)

Explanation / Answer

Answer 1: 4

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

---