Abstract Sorting Class

Create an abstract base class which will provide basic support for binary trees. Provide methods to search the tree, add or delete items, and print the tree. Use this abstract base class to derive a data class which contains a name, so that you create a binary tree of names. Write a program which illustrates creating a binary tree, adding and deleting names to the tree, and printing the tree. I'm looking to use this class in other places, so I need clean code that I can understand (I'm still a student). I also need a makefile to compile this on Linux using gcc/g++. ## Deliverables 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Complete ownership and distribution copyrights to all work purchased. ## Platform Code must compile using gcc/g++. I prefer to avoid C operators (char *, malloc) in favor of C++ operators (string, new)