Data Structure Questions and Answers-Binary Heap
Congratulations - you have completed Data Structure Questions and Answers-Binary Heap.
You scored %%SCORE%% out of %%TOTAL%%.
Your performance has been rated as %%RATING%%
Your answers are highlighted below.
Question 1 [CLICK ON ANY COICE TO KNOW RIGHT ANSWER]
What is the space complexity of searching in a heap?
Question 1 Explanation:
Question 2 [CLICK ON ANY COICE TO KNOW RIGHT ANSWER]
What is the best case complexity in builading a heap?
Question 2 Explanation:
The best case compexity occur in botton-up construction when we have a sortes array given.
Question 3 [CLICK ON ANY COICE TO KNOW RIGHT ANSWER]
Given the code, choose the correct option that is consistent with the code
build(A, i) left-> 2*i right->2*i +1 temp- > i if(left<= heap....length[A] ans A[left] >A[temp]) temp -> left if (right = heap....length[A] and A[right] > A[temp]) temp->right if temp!= i swap(A[i], A[temp]) build(A, temp)
Here A is the heap
It is the build function of max heap
It is the build function of min heap
It is general build function of any heap
None of the mentioned
Question 3 Explanation:
Since in every condition we are comparing the current value is less than the parent of that node.So this is build function of Max heap.
Question 4 [CLICK ON ANY COICE TO KNOW RIGHT ANSWER]
What is the location of parent node for any arbitary node i?
Question 4 Explanation:
For any node child nodes are located at either 2*i, 2*i +1 So the parent node could be found by taking the floor of the half of child node.
Question 5 [CLICK ON ANY COICE TO KNOW RIGHT ANSWER]
State the complexity of algorithm gien below
int function(vector<int> arr) int len=arr.length(); if(len==0) return; temp=arr[len-1]; arr.pop....back(); return temp;
Question 5 Explanation:
Deletion in a min-heap is in O(1) time.
Once you are finished, click the button below. Any items you have not completed will be marked incorrect.
There are 5 questions to complete.