(10 points) Show by example that a single erase operation in an AVL tree may require (n)trinode restructurings (or rotations) to restore the height-balance property. Draw a schematic of an AVL tree for which this is the case; explain your answer.

Find the inverse function of f(x)= 1+squareroot of 1+2x

Ahorse is how much percent more powerful than a pony

Reading characters and strings from the keyboard: consider the following c++ program 1. #include 2. #include 3. using namespace std; 4. mystring1 5. 6. int main() 7. { 8. 9. string mystring1, mystring2; mychar1 10. 11. 12. char mychar1, mychar2; 13. 14. cout< < "enter a string: "; mychar2 15. 16. cin> > mystring1; // 17. cin.get(mychar1); 18. cin> > mychar2; 19. getline(cin,mystring2); mystring2 20. 21. 22. cout<