We are give a BST with n nodes and our task is to balance this BST. What will…
We are give a BST with n nodes and our task is to balance this BST. What will be the time complexity of most efficient algorithm that solves our task?
- A.
O(n2)
- B.
O(n)
- C.
O(log n)
- D.
O(n logn)
Attempted by 431 students.
Sign up free to check your answer
Sign up freeLoading lesson…