AVL Tree & Mini Search Engine -- 2

you'll implement a very basic search engine. A typical search engine consists of several substantial components working in concert to keep the index up to date as well as allow users to issue queries. As part of implementing the search engine, you will implement an AVL Tree in C++ ( **maybe a hash table too?** ). You will also make use of the classes you've built throughout the semester to support the implementation. ## Implementation Requirements ### The AVL Tree Class The AVL tree class should provide an interface to a self-balancing binary search tree which performs self-balancing using the AVL algorithm. The AVL Tree class must be templated, and should contain inside of it a class to represent each individual node in the tree. The AVL Tree class must include a destructor which correctly frees all memory used by the tree. ### Dynamic Memory Management Any class which manages dynamic memory (both of these will) needs to include an overloaded assignment operator, a copy constructor, and a destructor. Omitting any of these functions could cause segmentation faults, memory leaks, and shallow copy-related problems. ### Testing Your Classes Be sure to include tests of your AVL tree class using the CATCH library.