Q. The binary tree sort implemented using a self – balancing binary search tree takes time isworst case. (Solved)

1. O(n log n)

2. O(n)

3. O(n2)

4. O(log n)

  • a. O(n log n)

Related Topics

Subscribe Now

Get All Updates & News