What is the complexity of adding an element to a heap?
A) O(1)
B) O(log (n) )
C) O(n log (n) )
D) O(n2)
Correct Answer:
Verified
Q97: Which of the following statements about a
Q98: If the postorder traversal of an expression
Q99: What are the differences between preorder, postorder,
Q101: If a min-heap has 1024 nodes, what
Q102: Given the MinHeap class discussed in section
Q104: Which action(s) will invalidate a min-heap so
Q105: What is the complexity of removing an
Q106: What is the efficiency of the heapsort
Q107: When we map a min-heap with n
Q108: If we have a heap with n
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents