A

Admin • 833.24K Points
Coach

Q. The binary tree sort implemented using a self – balancing binary search tree takes time is worst case.

  • (A) O(n log n)
  • (B) O(n)
  • (C) O(n2)
  • (D) O(log n)

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.