adplus-dvertising
frame-decoration

Question

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

a.

Ο(n2)

b.

Ο(n log n)

c.

Ο(n)

d.

Ο(1)

Answer: (c).Ο(n)

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

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.

Q. …………………. Is a directed tree in which out degree of each node is less than or equal to two.

Q. State true or false.

i) An empty tree is also a binary tree.

ii) In strictly binary tree, the out-degree of every node is either o or 2.

Q. When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return

Q. A binary tree whose every node has either zero or two children is called

Q. The depth of a complete binary tree is given by

Q. When representing any algebraic expression E which uses only binary operations in a 2-tree,