# YOU CAN DOWNLOAD 200+ SUBJECTS PDF BOOK FOR COMPETITIVE EXAMINATIONS

## Data Structure Questions and Answers-Binary Heap

Question 1 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

What is the space complexity of searching in a heap?

O(logn) | |

O(n) | |

O(1) | |

O(nlogn) |

Question 1 Explanation:

None.

Question 2 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

What is the best case complexity in builading a heap?

O(nlogn) | |

O(n ^{2}) | |

O(n*longn *logn) | |

O(n) |

Question 2 Explanation:

The best case compexity occur in botton-up construction when we have a sortes array given.

Question 3 [CLICK ON ANY CHOICE TO KNOW THE 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 CHOICE TO KNOW THE RIGHT ANSWER] |

What is the location of parent node for any arbitary node i?

(i/2) position | |

(i+1)/ position | |

floor(i/2) position | |

ceil(i/2) position |

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 CHOICE TO KNOW THE 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;

o(n) | |

O(logn) | |

O(1) | |

O(n logn) |

Question 5 Explanation:

Deletion in a min-heap is in O(1) time.

There are 5 questions to complete.