Fix my AVL and Red-Black trees and implement a deleteNode function

A private citizen learning data structures in C++: - Make sure the AVL and RB trees work correctly (especially when inserting new tree nodes). If they are incorrect, please fix them. - Implement a deleteNode function(s) (selection 'B' on each menu) that deletes a tree node from the AVL and RB trees and maintains balance. If the tree is already empty or the value from user input does not exist, throw an exception (look at the grayed-out remove function for guidance). Put the deletNode function definition(s) on the bottom of the .cpp files. Any helper functions or variables the user does not need to access should be private, not public. *Please stick to the style and format of the provided code. Make your code concise, readable, and easy to understand - leave comments.