What is a binary search tree? What is a balanced binary search tree? How is it related to a binary search of an array of data? How quickly can we find an item in a balanced binary search tree? Why is this more efficient than performing a binary search on a sorted list of data, especially as the data changes? What is an AVL tree? Why are AVL tress historically important? Tell us a little bit about the people after whom the AVL tree is named? What are left and right rotations in an AVL tree? How do they work?(we do not need a detailed technical answer, just a basic description.) Why are these rotations important? What is a Red-Black Tree? How does it compare (in terms of how it works) to an AVL tree?