adplus-dvertising
frame-decoration

Question

The time complexity to build a heap of n elements is

a.

O(1)

b.

O(lgn)

c.

O(n)

d.

O(nlgn)

Answer: (d).O(nlgn)

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. The time complexity to build a heap of n elements is

Similar Questions

Discover Related MCQs

Q. Which of the following can be the sequence of nodes examined in binary search tree while searching for key 88?

Q. For your ATM debit card, you have a 4-decimal-digit personal secret code. In the absence of any clue, a brute-force attack takes time-‘t’ to crack the code on an ATM terminal. Therefore ‘t’ is the secure-time for a customer to report in case the card is misplaced. Your Bank has decided to facilitate an increased secure-time. Out of the following, which option should provide the largest rise in the value of ‘t’ ?

Q. If we have six stack operations pushing and popping each of A, B and C-such that push (A) must occur before push (B) which must occur before push (C), then A, C, B is a possible order for the pop operations, since this could be our sequence : push (A), pop (A), push (B), push (C), pop (C), pop (B). Which one of the following orders could not be the order the pop operations are run, if we are to satisfy the requirements described above?

Q. What is the most appropriate data structure to implement a priority queue?

Q. In a complete binary tree of n nodes, how far are the two most distant nodes? Assume each edge in the path counts as !

Q. In a B tree of order 5, the following keys are inserted as follows :

7, 8, 1, 4, 13, 20, 2, 6 and 5

How many elements are present in the root of the tree?

Q. Encapsulation is

Q. Which of the statements are true?

I. Function overloading is done at compile time.
II. Protected members are accessible to the member of derived class.
III. A derived class inherits constructors and destructors.
IV. A friend function can be called like a normal function.
V. Nested class is a derived class.

Q. If the number of leaves in a strictly binary tree is an odd number, then what can you say with full conviction about total number of nodes in the tree?

Q. The number of edges in a complete graph of n vertices is

Q. At a hill station, the parking lot is one long drive way snaking up a hill side. Cars drive in and park right behind the car in front of them, one behind another. A car can’t leave until all the cars in front of it have left. Is the parking lot more like

Q. With regard to linked list, which of the following statement is false?

Q. A hash function f defined as f(key) = key mod 7, with linear probing used to resolve collisions. Insert the keys 37, 38, 72, 48, 98 and 11 into the table indexed from 0 to 6. What will be the location of 11?

Q. Queue is a ............. list.

Q. In a full binary tree of height k, there are ................. internal nodes.

Q. A binary tree is said to have heap property if the elements along any path:

Q. The graph K3,4 has:

Q. If (rear==maxsize-1) rear=0; else rear=rear+1; is required in:

Q. Which of the following does not define a tree?

Q. The complexity of Kruskal’s minimum spanning tree algorithm on a graph with ‘n’ nodes and ‘e’ edges is :