A

Admin • 833.24K Points
Coach

Q. The time required in best case for search operation in binary tree is ____________.

  • (A) O(n).
  • (B) O(2n).
  • (C) O(log n).
  • (D) O( log 2n).

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.