1. : What is a heap in data structures?
(A) A complete binary tree that satisfies the heap property
(B) A linear data structure
(C) A type of binary search tree
(D) A non-linear data structure
2. : What are the two types of heaps?
(A) Max heap and min heap
(B) Binary heap and ternary heap
(C) Complete heap and incomplete heap
(D) Full heap and empty heap
3. : In a max heap, which property is maintained?
(A) The key of a parent node is less than or equal to its children
(B) The key of a parent node is greater than or equal to its children
(C) All nodes must have two children
(D) The tree must be balanced
4. : What is the time complexity for inserting an element into a heap?
(A) O(1)
(B) O(log n)
(C) O(n)
(D) O(n log n)
5. : What is the time complexity for removing the maximum element from a max heap?
(A) O(1)
(B) O(log n)
(C) O(n)
(D) O(n log n)
6. : What is the main use of a heap?
(A) Storing sorted data
(B) Implementing priority queues
(C) Storing data in a linear format
(D) Representing graphs
7. : In a min heap, which property is maintained?
(A) The key of a parent node is less than or equal to its children
(B) The key of a parent node is greater than or equal to its children
(C) The heap is always complete
(D) The heap has at least one child
8. : What is the height of a complete binary heap with n nodes?
(A) O(1)
(B) log(n)
(C) O(n)
(D) O(n log n)
9. : Which of the following is true about heaps?
(A) Heaps are always balanced
(B) Heaps can be implemented using arrays
(C) Heaps cannot be used to sort data
(D) Heaps have a fixed size
10. : What is the process of restoring the heap property after an insertion called?
(A) Sifting down
(B) Sifting up
(C) Balancing
(D) Rotating
11. : What is the process of restoring the heap property after a deletion called?
(A) Sifting down
(B) Sifting up
(C) Balancing
(D) Rotating
12. : Which data structure can efficiently implement a priority queue?
(A) Stack
(B) Queue
(C) Binary tree
(D) Heap
13. : What is the time complexity of heap sort?
(A) O(n)
(B) O(n log n)
(C) O(n^2)
(D) O(log n)
14. : What is the primary disadvantage of a binary heap?
(A) It is inefficient for searching
(B) It requires too much memory
(C) It is always unbalanced
(D) It cannot be implemented with arrays
15. : What is the primary characteristic of a binary heap?
(A) It is a complete binary tree
(B) It is a balanced binary tree
(C) It is a binary search tree
(D) It can have nodes with only one child
16. : What happens to the structure of a heap after extracting the maximum element?
(A) It remains the same
(B) The last element is moved to the root
(C) The heap is destroyed
(D) It becomes a binary search tree
17. : Which operation is not typically supported by heaps?
(A) Insert
(B) Delete
(C) Find maximum
(D) Find arbitrary element
18. : How are heaps typically represented in memory?
(A) Using linked lists
(B) Using arrays
(C) Using hash tables
(D) Using trees
19. : What is the value of the root node in a min heap?
(A) The maximum value
(B) The minimum value
(C) The average value
(D) The median value
20. : What is a d-ary heap?
(A) A heap with d children per node
(B) A type of binary heap
(C) A complete binary tree
(D) A linear heap
21. : Which of the following is a property of a max heap?
(A) The left subtree is larger than the right subtree
(B) The parent node is always less than the child nodes
(C) The largest element is at the root
(D) All leaf nodes are at the same level
22. : In a binary heap, what is the index of the left child of a node at index i?
(A) 2i
(B) 2i + 1
(C) 2i + 2
(D) i/2
23. : In a binary heap, what is the index of the right child of a node at index i?
(A) 2i
(B) 2i + 1
(C) 2i + 2
(D) i/2
24. : What is the index of the parent of a node at index i in a binary heap?
(A) i/2
(B) (i-1)/2
(C) i + 1
(D) i – 1
25. : What is the purpose of a Fibonacci heap?
(A) To improve the performance of the binary heap
(B) To store elements in sorted order
(C) To provide faster decrease-key operations
(D) To maintain a balanced tree
26. : What is a priority queue?
(A) A queue that maintains the order of insertion
(B) A data structure that retrieves the highest priority element first
(C) A stack that allows priority access
(D) A regular queue
27. : What happens if you try to insert an element into a full binary heap?
(A) It throws an error
(B) It overwrites the root element
(C) It becomes a min heap
(D) It automatically expands
28. : How does a binary heap differ from a binary search tree?
(A) Heaps are sorted, while binary search trees are not
(B) Heaps allow efficient access to the largest or smallest element
(C) Binary search trees have a complete structure, while heaps do not
(D) Both structures allow random access
29. : What is the main advantage of using heaps over arrays for priority queues?
(A) Heaps require less memory
(B) Heaps allow for faster insertions and deletions
(C) Heaps are always balanced
(D) Heaps are easier to implement
30. : What is the use of a binary heap in the Dijkstra’s algorithm?
(A) To store the graph
(B) To efficiently retrieve the next node with the smallest distance
(C) To keep track of visited nodes
(D) To maintain the order of nodes
31. : What is a skew heap?
(A) A binary heap that is always complete
(B) A binary heap that allows arbitrary structure
(C) A self-adjusting heap
(D) A balanced binary tree
32. : What operation does the heapify function perform?
(A) Constructs a heap from an array
(B) Deletes the minimum element
(C) Inserts a new element
(D) Balances the heap
33. : What is the relationship between heaps and sorting algorithms?
(A) Heaps cannot be used for sorting
(B) Heaps are used in heap sort
(C) Heaps always produce sorted data
(D) Heaps require more time than other sorting algorithms
34. : Which type of heap is best suited for implementing a priority queue?
(A) Binary heap
(B) Ternary heap
(C) Fibonacci heap
(D) All of the above
35. : What is the impact of deleting the root in a heap?
(A) The heap is destroyed
(B) The last element is moved to the root and heapify is performed
(C) The heap remains unchanged
(D) The entire heap must be rebuilt
36. : How does a pair of heaps differ from other heaps?
(A) They maintain a balanced structure
(B) They allow for fast merging of heaps
(C) They are implemented using linked lists
(D) They do not support priority queues
37. : What type of data structure can a binary heap be implemented as?
(A) Array
(B) Linked list
(C) Tree
(D) All of the above
38. : What is the main disadvantage of a Fibonacci heap?
(A) It is difficult to implement
(B) It uses too much memory
(C) It is less efficient than binary heaps for all operations
(D) It cannot be used for priority queues