Zacwn53341 Zacwn53341 19-12-2022 Computers and Technology contestada given an n-node binary search tree that has never been balanced, the bst can be made into a balanced avl tree using o(log n) rotations.T/F