Question: What is the complexity of adding an element to the heap.

Options

A : O(log n)

B : O(h)

C : O(log n) & O(h)

D : O(n)

Click to view Correct Answer

Previous || Next

Data Structure Heap more questions

What is the space complexity of the post-order traversal in....

Space complexity for an adjacency list of an undirected graph....

What would the time complexity to check if an undirected....

The time complexity to find shortest distances by using Dijkstra’s....

What is the time complexity of Kruskal’s algorithm?

What is the run time efficiency of delete-min operation?

What is the running time of Hershberger algorithm?

What is the running time of Chan’s algorithm?

What is the worst case time in searching minimum value....

Balanced binary tree with n items allows the lookup of....

Data Structure Adjacency List more Online Exam Quiz

Data Structure Generating Combinations

Data Structure Generating Partitions

Data Structure Generating Subsets

Data Structure Graph

Data Structure Hash Tables

Data Structure Incidence Matrix Graph Structured Stack

Data Structure Inorder Traversal

Data Structure Interview

Data Structure Interview Experienced

Data Structure Interview Freshers