adplus-dvertising
frame-decoration

Question

Binary search tree has best case run-time complexity of Ο(log n). What could the worst case?

a.

Ο(n)

b.

Ο(n2)

c.

Ο(n3)

d.

None of the above

Answer: (a).Ο(n)

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Binary search tree has best case run-time complexity of Ο(log n). What could the worst case?

Similar Questions

Discover Related MCQs

Q. In order traversal of binary search tree will produce −

Q. In binary heap, whenever the root is removed then the rightmost element of last level is replaced by the root. Why?

Q. If we choose Prim's Algorithm for uniquely weighted spanning tree instead of Kruskal's Algorithm, then

Q. The number of binary trees with 3 nodes which when traversed in post order gives the sequence A,B,C is ?

Q. Which method can find if two vertices x & y have path between them?

Q. Access time of a binary search tree may go worse in terms of time complexity upto

Q. Visiting root node after visiting left and right sub-trees is called

Q. In the deletion operation of max heap, the root is replaced by

Q. All possible spanning trees of graph G

Q. Binary search tree is an example of complete binary tree with special attributes.

Q. Maximum number of nodes in a binary tree with height k, where root is height 0, is

Q. In a min heap

Q. Re-balancing of AVL tree costs

Q. A binary search tree whose left subtree and right subtree differ in height by at most 1 unit is called ……

Q. Herder node is used as sentinel in …..

Q. In the …………….. traversal we process all of a vertex’s descendants before we move to an adjacent vertex.

Q. The property of binary tree is

Q. State true or false.

i) The degree of root node is always zero.

ii) Nodes that are not root and not leaf are called as internal nodes.

Q. Any node is the path from the root to the node is called

Q. State true of false.

i) A node is a parent if it has successor nodes.

ii) A node is child node if out degree is one.