Heap in Data Structure

@T-Bone

This question paper focuses on the "Heap" of Data Structure. These Multiple Choice Questions (mcq) should be practiced to improve the Data Structure skills required for various interviews (campus interview, walk-in interview, company interview), placement, entrance exam and other competitive examinations.

This question paper focuses on the "Heap" of Data Structure. These Multiple Choice Questions (mcq) should be practiced to improve the Data Structure skills required for various interviews (campus interview, walk-in interview, company interview), placement, entrance exam and other competitive examinations.

Questions

1. A ________ is a special Tree-based data structure in which the tree is a complete binary tree.?

Mark the correct option

2. How many type of heap are there?

Mark the correct option

3. n which heap the root node must be greatest among the keys present at all of it’s children?

Mark the correct option

4. hat is the complexity of adding an element to the heap?

Mark the correct option

5. Heap can be used as ________________

Mark the correct option

6. An array consists of n elements. We want to create a heap using the elements. The time complexity of building a heap will be in order of

Mark the correct option

7. Min heap can be used to implement selection sort.

Mark the correct option

8. Which one of the following array elements represents a binary min heap?

Mark the correct option

9. Given an array of element 5, 7, 9, 1, 3, 10, 8, 4. Which of the following is the correct sequences of elements after inserting all the elements in a min-heap?

Mark the correct option

10. What is the amortized cost per operation of a skew heap?

Mark the correct option

Index of Questions