[Solved] What are the worst case and average case complexities of a binary search tree?

McqMate

Q.	What are the worst case and average case complexities of a binary search tree?
A.	O(n), O(n)
B.	O(logn), O(logn)
C.	O(logn), O(n)
D.	O(n), O(logn)
Answer» D. O(n), O(logn)

1.5k

0

Do you find this helpful?

1

View all MCQs in

Data Structures (DS)

Discussion

No comments yet

Related MCQs

The binary tree sort implemented using a self – balancing binary search tree takes time is worst case.
Consider the following data. The pre order traversal of a binary tree is A, B, E, C, D. The in order traversal of the same binary tree is B, E, A, D, C. The level order sequence for the binary tree is
When converting binary tree into extended binary tree, all the original nodes in binary tree are___________.
A binary search tree contains values 7, 8, 13, 26, 35, 40, 70, 75. Which one of the following is a valid post-order sequence of the tree provided the pre-order sequence as 35, 13, 7, 8, 26, 70, 40 and 75?
A binary tree of depth "d" is an almost complete binary tree if __________.
An AVL tree is a self – balancing binary search tree, in which the heights of the two child sub trees of any node differ by
What is the worst case complexity of binary search using recursion?
The time required in best case for search operation in binary tree is ____________.
What is the best case and worst case complexity of ordered linear search?
The pre-order and in-order are traversals of a binary tree are T M L N P O Q and L M N T O P Q. Which of following is post-order traversal of the tree?