In a Binary Search Tree (BST) what is the time complexity...

Home / Data Structure / Trees In Data Structures / Question

Examveda

In a Binary Search Tree (BST), what is the time complexity of searching for an element in the worst case?

A. O(1)

B. O(log n)

C. O(n)

D. O(n log n)

Answer: Option C

Related Questions on Trees in Data Structures

A. 2

B. 3

C. 4

D. Any number

View Answer

A. Root

B. Leaf

C. Parent

D. Sibling

View Answer

A. Inorder

B. Preorder

C. Postorder

D. Level-order

View Answer

A. n-1

B. n

C. 2n-1

D. 2n

View Answer