Given a binary search tree,describe how you could convert it into an AVL tree with worst-case time O(nlogn) and best case O(n)?I searched that question but didn't understand the answer that is: We can traverse the tree in O(n) ...