In C++ implement containers based on BST and AVL trees and compare their performance. Also, we practice using basic inheritance. Create a Second class for AVL. AVL tree Implement a class template AVL that stores items of class Type in form of AVL tree. Objects of class Type are guaranteed to be comparable and have operator<<. There should be the same public methods as in case of BST and any other private methods that you need. Class AVL should be derived from BST.

Implement a class template BST that stores items of class Type in form of binary search tree. Objects of class Type are guaranteed to be comparable and have operator<<. There should be the following methods:

Default constructor that initializes empty container.

Destructor. Make sure destructor avoids memory leaks.

Height() function returns the height of the tree.

Size() function returns the number of items in container.

Print() function that prints the content of the container sorted in ascending order.

Subscripting operator (operator[]) that returns a reference to the item.

Insert( const Type & ).

Remove( const Type & ).

Copy assignment operator.